Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Randomized optimal algorithm for slope selection
Information Processing Letters
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
An algorithm for approximate closest-point queries
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Path caching (extended abstract): a technique for optimal external searching
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Randomized algorithms
Temporal conditions and integrity constraints in active database systems
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Indexing for data models with constraints and classes
Journal of Computer and System Sciences
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Queries on Voronoi diagrams of moving points
Computational Geometry: Theory and Applications
The complexity of query evaluation in indefinite temporal constraint databases
Selected papers from the international workshop on Uncertainty in databases and deductive systems
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Proximity problems on moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Multidimensional access methods
ACM Computing Surveys (CSUR)
Abstract and discrete modeling of spatio-temporal data types
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DOMINO: databases fOr MovINg Objects tracking
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Kinetic binary space partitions for intersecting segments and disjoint triangles
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Updating and Querying Databases that Track Mobile Units
Distributed and Parallel Databases - Special issue on mobile data management and applications
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A data model and data structures for moving objects databases
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
Efficient searching with linear constraints
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Design of Dynamic Data Structures
Design of Dynamic Data Structures
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Modeling and Querying Moving Objects
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Cost and Imprecision in Modeling the Position of Moving Objects
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Moving Objects Databases: Issues and Solutions
SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
STAR-Tree: An Efficient Self-Adjusting Index for Moving Objects
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Spatial Data Structures: Concepts and Design Choices
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
External memory data structures
Handbook of massive data sets
Developments in Spatio-Temporal Query Languages
DEXA '99 Proceedings of the 10th International Workshop on Database & Expert Systems Applications
A Geometric Framework for Specifying Spatiotemporal Objects
TIME '99 Proceedings of the Sixth International Workshop on Temporal Representation and Reasoning
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Querying about the Past, the Present, and the Future in Spatio-Temporal Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Approximating extent measures of points
Journal of the ACM (JACM)
Spatio-temporal data reduction with deterministic error bounds
The VLDB Journal — The International Journal on Very Large Data Bases
ACM SIGMOBILE Mobile Computing and Communications Review
Efficient proximity detection among mobile targets with dead reckoning
Proceedings of the 4th ACM international workshop on Mobility management and wireless access
Kinetic KD-trees and longest-side KD-trees
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Out-of-order event processing in kinetic data structures
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Extending the LBS-framework TraX: Efficient proximity detection with dead reckoning
Computer Communications
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Kinetic and dynamic data structures for closest pair and all nearest neighbors
ACM Transactions on Algorithms (TALG)
Efficient search of moving objects on a planar graph
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Efficient clique detection among mobile targets
Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
Indexing Moving Objects for Trajectory Retrieval on Location-Based Services
IEICE - Transactions on Information and Systems
RoboEarth: connecting robots worldwide
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Location-dependent query processing: Where we are and where we are heading
ACM Computing Surveys (CSUR)
Inferring additional knowledge from QTCN relations
Information Sciences: an International Journal
Kinetic kd-Trees and Longest-Side kd-Trees
SIAM Journal on Computing
FIFO indexes for decomposable problems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
International Journal of Intelligent Information and Database Systems
Kinetic data structures for all nearest neighbors and closest pair in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
Hi-index | 0.00 |
We propose three indexing schemes for storing a set S of N points in the plane, each moving along a linear trajectory, so that any query of the following form can be answered quickly: Given a rectangle R and a real value t, report all K points of S that lie inside R at time t. We first present an indexing structure that, for any given constant ε 0, uses O(N/B) disk blocks and answers a query in O(N/B1/2+ε + K/B)I/Os, where B is the block size. It can also report all the points of S that lie inside R during a given time interval. A point can be inserted or deleted, or the trajectory of a point can be changed, in O(log2BN) I/Os. Next, we present a general approach that improves the query time if the queries arrive in chronological order, by allowing the index to evolve over time. We obtain a tradeoff between the query time and the number of times the index needs to be updated as the points move. We also describe an indexing scheme in which the number of I/Os required to answer a query depends monotonically on the difference between the query time stamp t and the current time. Finally, we develop an efficient indexing scheme to answer approximate nearest-neighbor queries among moving points.