ACM Transactions on Database Systems (TODS)
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Continuous queries over append-only databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On the semantics of “now” in databases
ACM Transactions on Database Systems (TODS)
CQ: a personalized update monitoring toolkit
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficient and extensible algorithms for multi query optimization
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
NiagaraCQ: a scalable continuous query system for Internet databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Continuously adaptive continuous queries over streams
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Continuous queries over data streams
ACM SIGMOD Record
IEEE Transactions on Computers
Continual Queries for Internet Scale Event-Driven Information Delivery
IEEE Transactions on Knowledge and Data Engineering
Multiple Query Processing in Deductive Databases using Query Graphs
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
Disseminating Updates on Broadcast Disks
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
IDEAS '02 Proceedings of the 2002 International Symposium on Database Engineering & Applications
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree
MDM '02 Proceedings of the Third International Conference on Mobile Data Management
Query Processing in Broadcasted Spatial Index Trees
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Q+Rtree: Efficient Indexing for Moving Object Databases
DASFAA '03 Proceedings of the Eighth International Conference on Database Systems for Advanced Applications
Differential evaluation of continual queries
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Streaming queries over streaming data
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Scheduling for shared window joins over data streams
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
SEA-CNN: Scalable Processing of Continuous K-Nearest Neighbor Queries in Spatio-temporal Databases
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
GPAC: generic and progressive processing of mobile queries over mobile data
Proceedings of the 6th international conference on Mobile data management
An adaptive hashing technique for indexing moving objects
Data & Knowledge Engineering
A peer-to-peer spatial cloaking algorithm for anonymous location-based service
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Efficient techniques for realizing geo-spatial access control
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
PLACE: a query processor for handling real-time spatio-temporal data streams
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Toward context and preference-aware location-based services
Proceedings of the Eighth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Clustersheddy: load shedding using moving clusters over spatio-temporal data streams
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Continuous query processing in spatio-temporal databases
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Scalable continuous query processing and moving object indexing in spatio-temporal databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Hi-index | 0.00 |
The emergence of location-aware services calls for new real time spatio-temporal query processing algorithms that deal with large numbers of mobile objects and queries. Online query response is an important characterization of location-aware services. A delay in the answer to a query gives invalid and obsolete results, simply because moving objects can change their locations before the query responds. To handle large numbers of spatio-temporal queries efficiently, we propose the idea of sharing as a means to achieve scalability. In this paper, we introduce several types of sharing in the context of continuous spatio-temporal queries. Examples of sharing in the context of real-time spatio-temporal database systems include sharing the execution, sharing the underlying space, sharing the sliding time windows, and sharing the objects of interest. We demonstrate how sharing can be integrated into query predicates, e.g., selection and spatial join processing. The goal of this paper is to outline research directions and approaches that will lead to scalable and efficient location-aware services.