Performance evaluation of a temporal database management system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
File structures: an analytic approach
File structures: an analytic approach
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
Introduction to algorithms
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
Journal of the ACM (JACM)
Fundamentals of database systems (2nd ed.)
Fundamentals of database systems (2nd ed.)
A consensus glossary of temporal database concepts
ACM SIGMOD Record
The snapshot index: an I/O-optimal access method for timeslice queries
Information Systems
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Database management systems
An extensible notation for spatiotemporal index queries
ACM SIGMOD Record
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
File Structures
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
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
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Efficient Evaluation of the Valid-Time Natural Join
Proceedings of the Tenth International Conference on Data Engineering
Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Temporal Query Processing and Optimization in Multiprocessor Database Machines
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Query Processing Techniques for Multiversion Access Methods
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Incremental Join of Time-Oriented Data
SSDBM '99 Proceedings of the 11th International Conference on Scientific and Statistical Database Management
Efficient schemes for managing multiversionXML documents
The VLDB Journal — The International Journal on Very Large Data Bases
Indexing moving objects based on 2 n index tree
AIKED'07 Proceedings of the 6th Conference on 6th WSEAS Int. Conf. on Artificial Intelligence, Knowledge Engineering and Data Bases - Volume 6
Transactions on the multiversion B+-tree
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Concurrent updating transactions on versioned data
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Information Sciences: an International Journal
An implicit approach to deal with periodically repeated medical data
Artificial Intelligence in Medicine
Resolving journaling of journal anomaly in android I/O: multi-version B-tree with lazy split
FAST'14 Proceedings of the 12th USENIX conference on File and Storage Technologies
| Hi-index | 0.00 |
External dynamic hashing has been used in traditional database systems as a fast method for answering membership queries. Given a dynamic set S of objects, a membership query asks whether an object with identity k is in (the most current state of) S. This paper addresses the more general problem of Temporal Hashing. In this setting, changes to the dynamic set are timestamped and the membership query has a temporal predicate, as in: "Find whether object with identity k was in set S at time t. " We present an efficient solution for this problem that takes an ephemeral hashing scheme and makes it partially persistent. Our solution, also termed partially persistent hashing, uses linear space on the total number of changes in the evolution of set S and has a small (O(\log_B(n/B))) query overhead. An experimental comparison of partially persistent hashing with various straightforward approaches (like external linear hashing, the Multiversion B-Tree, and the R*-tree) shows that it provides the faster membership query response time. Partially persistent hashing should be seen as an extension of traditional external dynamic hashing in a temporal environment. It is independent of the ephemeral dynamic hashing scheme used; while the paper concentrates on linear hashing, the methodology applies to other dynamic hashing schemes as well.