Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Using write-once memory for database storage
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Dynamic Data Structures on Optical Disks
Proceedings of the First International Conference on Data Engineering
How to reuse a "write - once " memory (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
What if Mass Storage Were Free?
Computer
Retrieval performance versus disc space utilization on WORM optical discs
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Access methods for multiversion data
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Database support for evolving design objects
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
File organizations and access methods for CLV disks
SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
A Checkpointing Page Store for Write-Once Optical Disk
IEEE Transactions on Computers
The performance of a multiversion access method
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Optimal placement of high-probability randomly retrieved blocks on CLV optical discs
ACM Transactions on Information Systems (TOIS)
Segment indexes: dynamic indexing techniques for multi-dimensional interval data
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
Indexing for Multiversion Locking: Alternatives and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
The Indispensability of Dispensable Indexes
IEEE Transactions on Knowledge and Data Engineering
The BT-tree: A Branched and Temporal Access Method
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Efficient Management of Multiversion Documents by Object Referencing
Proceedings of the 27th 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
Efficient schemes for managing multiversionXML documents
The VLDB Journal — The International Journal on Very Large Data Bases
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
Fossilized index: the linchpin of trustworthy non-alterable electronic records
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Trustworthy keyword search for regulatory-compliant records retention
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Technical forum: worm storage is not enough
IBM Systems Journal
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Transaction time indexing with version compression
Proceedings of the VLDB Endowment
Multiversion join index for multiversion data warehouse
Information and Software Technology
Transactions on the multiversion B+-tree
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
The HV-tree: a memory hierarchy aware version index
Proceedings of the VLDB Endowment
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
Data structures for multiversion data warehouse
ADBIS'09 Proceedings of the 13th East European conference on Advances in Databases and Information Systems
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.01 |