Results 221 to 230 of about 35,488 (260)

Distributed processing of continuous range queries

Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication, 2014
This paper addresses the problem of efficient processing of continuous range queries over moving objects. Existing server-centric methods increase the server workload and entail a huge amount of communication cost when the number of moving objects is enormous.
Kwanho In, HaRim Jung, DongEun Kim, GiWoong Nam, Ung-Mo Kim   +4 more
openaire   +1 more source

Distributed query processing for mobile surveillance

Proceedings of the 15th ACM international conference on Multimedia, 2007
Addressing core issues in mobile surveillance, we present an architecture for querying and retrieving distributed, semi-permanent multi-modal data through challenged networks with limited connectivity. The system provides a rich set of queries for spatio-temporal querying in a surveillance context, and uses the network availability to provide best ...
Stewart Greenhill, Svetha Venkatesh
openaire   +1 more source

Query processing in a distributed data base

Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers - SIGSMALL '83, 1983
The current research on optimizing algorithms for queries in distributed data base networks is presented. An identification of additional factors which add cost and time to processing of a query both at a node and in the transporting of data along a link in the network is given.
Diane Jantz, Elizabeth A. Unger, Richard A. McBride, Jacob Slonim   +3 more
openaire   +1 more source

Efficient processing of distributed set queries

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications, 2002
The problem of efficiently processing queries that manipulate sets is considered with the objective of minimizing the processing cost by reducing the size of transmitted data as much as possible. The semantics of set operations is used to achieve this goal. A set query has the general form SET 1 op SET 2.
Mohamed E. El-Sharkawi, Yahiko Kambayashi   +1 more
openaire   +1 more source

Distributed skyline trajectory query processing

Proceedings of the ACM Turing 50th Celebration Conference - China, 2017
The massive amount of trajectory data collected from GPS has emerged in recent year. Many researchers proposed trajectory queries such as top-k query. They focused to solve them based on distance and text relevance. However, the weight of these queries are unknown. Therefore, we plan to handle the trajectory skyline query based on distance and activity
Amina Belhassena, Hongzhi Wang 0001
openaire   +1 more source

Dynamic distributed query processing techniques

Proceedings of the seventeenth annual ACM conference on Computer science : Computing trends in the 1990's Computing trends in the 1990's - CSC '89, 1989
As optimization of strategies to process queries in a Distributed DataBase (DDB) uses various techniques to estimate the sizes of partial results and other parameters pertaining to the distributed environment, if these estimates are inaccurate the strategies may be far from optimal.
Peter Bodorik, J. Spruce Riordon, C. Jacob   +2 more
openaire   +1 more source

Processing search queries in a distributed environment

Proceedings of the thirteenth ACM international conference on Information and knowledge management, 2004
Endeca's approach to processing search queries in a distributed computing environment is predicated on concerns of correctness, scalability, and flexibility in deployment. Using a master-slave architecture, we are able to support classic search as well as more advanced features.
Frederick Knabe, Daniel Tunkelang
openaire   +1 more source

Performance issues in distributed query processing

IEEE Transactions on Parallel and Distributed Systems, 1993
The authors discuss various performance issues in distributed query processing. They validate and evaluate the performance of the local reduction (LR) the fragment and replicate strategy (FRS) and the partition and replicate strategy (PRS) optimization algorithms.
Chengwen Liu, Clement T. Yu
openaire   +1 more source

Fault-Tolerance in Distributed Query Processing

9th International Database Engineering & Application Symposium (IDEAS'05), 2006
Fault-tolerance has long been a feature of database systems, with transactions supporting the structuring of applications so as to ensure continuation of updating applications in spite of machine failures. For read-only queries the perceived wisdom has been that support for fault-tolerance is too expensive to be worthwhile. Distributed query processing
Smith J, Watson P
openaire   +1 more source

Composite semijoins in distributed query processing

Information Sciences, 1990
This paper deals with minimizing the response time for distributed queries, using the composite semijoin operation. A composite semijoin is a semijoin in which the projection and transmission involve multiple columns. Several sets of distributed query processing algorithms are considered and these algorithms are extended to include the reductions ...
William Perrizo, Chun-Shwu Chen
openaire   +2 more sources