A fundamental problem to be solved in systems which derive rules from database tables to use in query optimisation is the workload involved. If the data server has to do the work it can interfere with query processing and cause slower query answering, which is the opposite of the required effect. This paper reports our investigation of the use of multiple workstations in the same local network ...

In this work, we propose an efficient multicast routing protocol for mobile ad hoc networks. To achieve high efficiency with low channel and storage overhead, the proposed protocol employs the following mechanism: 1 on-demand invocation of route setup and route maintenance process to avoid periodical control packet transmissions, thus reducing channel overhead, 2 creation of “forwarding group” ...

Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...

the present article begins with an articulation of the significance and relation of ‘query and response’ with both dialogue and its semantic perimeters and discloses the sources of rumi’s thinking about this issue. after this taking a comparative stance, this article briefly explores the background and the significance of query and response, dialogue and dialectic as they relate to both ontolog...

Structured P2P systems are effective for exact key searches in a distributed environment as they offer scalability, self-organization, and dynamicity. These valuable properties also make them a candidate for more complex queries, such as range queries. In this paper, we describe PRoBe, a system that supports range queries over multiple attributes in P2P networks. PRoBe uses a multi-dimensional ...

Efficient content distribution is one of the emerging applications in vehicular networks. To provide scalable content distribution in vehicular networks, Chord peer-to-peer overlay could be applied. Most P2P protocols, including Chord, are designed for wired-line network, and might perform poorly in mobile networks. Mobile Chord (MChord) is proposed to enhance the P2P performance over vehicular...

In this paper we propose an efficient geocasting scheme based on flooding for cases where a source node sends request messages to nodes in the destination area and receives replies from some of them, Geocasting based on Successful Transmission Records (GSTR). Generally geocast protocols based on flooding generate many redundant messages which generate transmission errors. In GSTR, each node rec...

Many Content Based Image Retrieval systems (CBIRs) have been invented in the last decade. The general mechanism of the search process is very similar for each of these CBIRs, and the calculation of rankings is determined by the comparison of features (low-, mid-, high-level). Nevertheless, all things being equal, the respective realization leads to different results. Knowledge about the interna...

SQL Injection (SQLI) is a common vulnerability found in web applications. The starting point of SQLI attack is the client-side (browser). If attack inputs can be detected early at the browse side, then it could be thwarted early by not forwarding the malicious inputs to the server-side for further processing. This paper presents a client-side approach to detect SQLI attacks. The client-side acc...

Consider an ordered universe U , and a set T ⊂ U with |T | = n. The goal is to preprocess T , such that the following query can be answered efficiently: given x ∈ U , report the predecessor of x, i.e. max{y ∈ T | y < x}. We can also consider the dynamic problem, where elements are inserted and deleted into T . Let tq be the query time, and tu the update time. This is a fundamental search proble...