Current spatial-keyword publish/subscribe systems need to handle spatial-keyword skyline queries over geo-textual streams to continuously obtain good results. The skyline queries in such systems face two main problems: (1) query problems, because the ...

In many applications, such as homeland security, image processing, social network, and bioinformatics, it is often required to support an approximate membership query (AMQ) to answer a question like “is an (query) object q near to at least one of ...

Data centers are well known to consume a large amount of energy. As databases are one of the major applications in a data center, building energy-aware database systems has become an active research topic recently. The quantification of the energy cost of ...

Indexing provides for selective tuning but suffers from the drawback that, in order to conserve battery power, the client has to wait for and tune to the index segment. In Location-Aware Mobile Services (LAMSs), it is important to reduce the query ...

Data broadcast is an excellent method for efficient data dissemination in the mobile computing environment. The application domain of data broadcast will be widely expanded in the near future, where the client is expected to perform complex queries or ...

The query processing in a mobile computing environment involves join processing among different sites which include static servers and mobile computers. Because of the presence of asymmetric features in a mobile computing environment, the conventional ...

Moving object environments are characterized by large numbers of moving objects and numerous concurrent continuous queries over these objects. Efficient evaluation of these queries in response to the movement of the objects is critical for supporting ...

Modifications to a clustering algorithm in which objects are adaptively partitioned into clusters of equal size are described. The object migration automaton has the advantage of being conceptually simple and easy to implement. Unfortunately, the ...

Three deterministic learning automata solutions to the problem of equipartitioning are presented. Although the first two are epsilon -optimal, they seem to be practically feasible only when a set of W objects is small. The last solution, which uses a ...

We propose a design methodology based on data flow analysis for a functionally distributed, multiprocessor database machine. We define a cost model of database processing with the objective cost being response time of a set of query strategies. ...

A simple and efficient method for processing general equijoin queries in a distributed relational database is described. The query is first decomposed into a set of simple queries, each being involved with only one of the joining domains and its ...