Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Computer
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Access methods for multiversion data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Introduction to algorithms
Event-join optimization in temporal relational databases
VLDB '89 Proceedings of the 15th international conference on Very large data bases
The time index—an access structure for temporal data
Proceedings of the sixteenth international conference on Very large databases
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Overlapping B+trees for temporal data
JCIT Proceedings of the fifth Jerusalem conference on Information technology
Segment indexes: dynamic indexing techniques for multi-dimensional interval data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Indexing for data models with constraints and classes (extended abstract)
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of Management Information Systems
A consensus glossary of temporal database concepts
ACM SIGMOD Record
ACM SIGMOD Record
The snapshot index: an I/O-optimal access method for timeslice queries
Information Systems
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Designing access methods for bitemporal databases
Designing access methods for bitemporal databases
An extensible notation for spatiotemporal index queries
ACM SIGMOD Record
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Historical queries along multiple lines of time evolution
The VLDB Journal — The International Journal on Very Large Data Bases
Incremental Implementation Model for Relational Databases with Transaction Time
IEEE Transactions on Knowledge and Data Engineering
Temporal and Real-Time Databases: A Survey
IEEE Transactions on Knowledge and Data Engineering
Efficient Management of Time-Evolving Databases
IEEE Transactions on Knowledge and Data Engineering
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
Indexing Techniques for Historical Databases
Proceedings of the Fifth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Access Methods for Bi-Temporal Databases
Proceedings of the International Workshop on Temporal Databases: Recent Advances in Temporal Databases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Efficient computation of temporal aggregates with range predicates
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient integration and aggregation of historical information
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
Trajectory queries and octagons in moving object databases
Proceedings of the eleventh international conference on Information and knowledge management
IEEE Transactions on Computers
The Indispensability of Dispensable Indexes
IEEE Transactions on Knowledge and Data Engineering
Indexing Animated Objects Using Spatiotemporal Access Methods
IEEE Transactions on Knowledge and Data Engineering
Hashing Methods for Temporal Data
IEEE Transactions on Knowledge and Data Engineering
Efficient Indexing of Spatiotemporal Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Aggregate Processing of Planar Points
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
R-Tree Based Indexing of Now-Relative Bitemporal Data
VLDB '98 Proceedings of the 24rd 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
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Database Versions to Represent Bitemporal Databases
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Temporal Indexing with Multidimensional File Structures
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Efficient Evaluation of Continuous Range Queries on Moving Objects
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Efficient Complex Query Support for Multiversion XML Documents
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Efficient schemes for managing multiversionXML documents
The VLDB Journal — The International Journal on Very Large Data Bases
Light-Weight Indexing of General Bitemporal Data
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Journal of Computer Science and Technology
Main Memory Evaluation of Monitoring Queries Over Moving Objects
Distributed and Parallel Databases
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Historical spatio-temporal aggregation
ACM Transactions on Information Systems (TOIS)
Metadata Efficiency in Versioning File Systems
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
Handling frequent updates of moving objects
Proceedings of the 14th ACM international conference on Information and knowledge management
Supporting complex queries on multiversion XML documents
ACM Transactions on Internet Technology (TOIT)
Indexing the past, present, and anticipated future positions of moving objects
ACM Transactions on Database Systems (TODS)
Real-Time Processing of Range-Monitoring Queries in Heterogeneous Mobile Databases
IEEE Transactions on Mobile Computing
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
On past-time indexing of moving objects
Journal of Systems and Software
Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations
IEEE Transactions on Knowledge and Data Engineering
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
A survey of persistent data structures
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
The POINT approach to represent now in bitemporal databases
Journal of Intelligent Information Systems
BiB+-tree: an efficient multiversion access method for bitemporal databases
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
Metadata efficiency in versioning file systems
FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
A cost model for an adaptive cell-based index structure
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
The self-relocating index scheme for telematics GIS
W2GIS'05 Proceedings of the 5th international conference on Web and Wireless Geographical Information Systems
Indexing partial history trajectory and future position of moving objects using HTPR*-Tree
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications
A triangular decomposition access method for temporal data - TD-tree
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
Hi-index | 0.00 |
By supporting the valid and transaction time dimensions, bitemporal databases represent reality more accurately than conventional databases. In this paper, we examine the issues involved in designing efficient access methods for bitemporal databases, and propose the partial-persistence and the double-tree methodologies. The partial-persistence methodology reduces bitemporal queries to partial persistence problems for which an efficient access method is then designed. The double-tree methodology "sees" each bitemporal data object as consisting of two intervals (a valid-time and a transaction-time interval) and divides objects into two categories according to whether the right endpoint of the transaction time interval is already known. A common characteristic of both methodologies is that they take into account the properties of each time dimension. Their performance is compared with a straightforward approach that "sees" the intervals associated with a bitemporal object as composing one rectangle, which is stored in a single multidimensional access method. Given that some limited additional space is available, our experimental results show that the partial-persistence methodology provides the best overall performance, especially for transaction timeslice queries. For those applications that require ready, off-the-shelf, access methods, the double-tree methodology is a good alternative.