An efficient I/O interface for optical disks
ACM Transactions on Database Systems (TODS)
Key-sequence data sets on indelible storage
IBM Journal of Research and Development
Computer
The temporal query language TQuel
ACM Transactions on Database Systems (TODS)
Logical modeling of temporal data
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Partitioned storage for temporal databases
Information Systems
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
A temporal relational model and a query language
Information Sciences: an International Journal
The time index—an access structure for temporal data
Proceedings of the sixteenth international conference on Very large databases
The performance of a multiversion access method
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Efficient algorithms for managing the history of evolving databases
ICDT '90 Proceedings of the third international conference on database theory on Database theory
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
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 '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
On an algebra for historical relational databases: two views
SIGMOD '85 Proceedings of the 1985 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
Designing DBMS support for the temporal dimension
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Efficient Indexing Methods for Temporal Relations
IEEE Transactions on Knowledge and Data Engineering
Indexing Techniques for Historical Databases
Proceedings of the Fifth International Conference on Data Engineering
The TP-Index: A Dynamic and Efficient Indexing Mechanism for Temporal Databases
Proceedings of the Tenth International Conference on Data Engineering
The Design of the POSTGRES Storage System
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
On Optimal Multiversion Access Structures
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Efficient declustering techniques for temporal access structures
ADC '01 Proceedings of the 12th Australasian database conference
Cost models for overlapping and multiversion structures
ACM Transactions on Database Systems (TODS)
Supporting Temporal Views in a ManagementInformation Base
Journal of Network and Systems Management
Designing Access Methods for Bitemporal Databases
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
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th 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
Online Data Structures in External Memory
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Time Responsive External Data Structures for Moving Points
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Online Data Structures in External Memory
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
An Efficient Spatiotemporal Indexing Method for Moving Objects in Mobile Communication Environments
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
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
External memory data structures
Handbook of massive data sets
Journal of Computer and System Sciences - Special issue on PODS 2000
Approximate Temporal Aggregation
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
I/O-efficient point location using persistent B-trees
Journal of Experimental Algorithmics (JEA)
Benchmarking access methods for time-evolving regional data
Data & Knowledge Engineering
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Adaptive index management for future location-based queries
Journal of Systems and Software
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
Supporting complex queries on multiversion XML documents
ACM Transactions on Internet Technology (TOIT)
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
A new framework for addressing temporal range queries and some preliminary results
Theoretical Computer Science
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The SBC-tree: an index for run-length compressed sequences
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
A survey of persistent data structures
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
I/o-efficient efficient algorithms for computing contours on a terrain
Proceedings of the twenty-fourth annual symposium on Computational geometry
Efficient temporal counting with bounded error
The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Multiversion join index for multiversion data warehouse
Information and Software Technology
Indexing Moving Objects for Trajectory Retrieval on Location-Based Services
IEICE - Transactions on Information and Systems
Worst-case efficient range search indexing: invited tutorial
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Recent Advances in Worst-Case Efficient Range Search Indexing
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Concurrent updating transactions on versioned data
IDEAS '09 Proceedings of the 2009 International Database Engineering & Applications Symposium
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
A time efficient indexing scheme for complex spatiotemporal retrieval
ACM SIGMOD Record
External-memory algorithms and data structures
Algorithms and theory of computation handbook
Consistent and durable data structures for non-volatile byte-addressable memory
FAST'11 Proceedings of the 9th USENIX conference on File and stroage technologies
Metadata efficiency in versioning file systems
FAST'03 Proceedings of the 2nd USENIX conference on File and storage technologies
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
I/O-efficient contour queries on terrains
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
How to pack directed acyclic graphs into small blocks
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Partially persistent B-trees with constant worst-case update time
Computers and Electrical Engineering
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
Space-efficient range reporting for categorical data
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Temporal and multi-versioned XML documents: A survey
Information Processing and Management: an International Journal
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
Efficient bulk updates on multiversion B-trees
Proceedings of the VLDB Endowment
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 |
An efficient multiversion access structure for a transaction-time database is presented. Our method requires optimal storage and query times for several important queries and logarithmic update times. Three version operations驴inserts, updates, and deletes驴are allowed on the current database, while queries are allowed on any version, present or past. The following query operations are performed in optimal query time: key range search, key history search, and time range view. The key-range query retrieves all records having keys in a specified key range at a specified time; the key history query retrieves all records with a given key in a specified time range; and the time range view query retrieves all records that were current during a specified time interval. Special cases of these queries include the key search query, which retrieves a particular version of a record, and the snapshot query which reconstructs the database at some past time. To the best of our knowledge no previous multiversion access structure simultaneously supports all these query and version operations within these time and space bounds. The bounds on query operations are worst case per operation, while those for storage space and version operations are (worst-case) amortized over a sequence of version operations. Simulation results show that good storage utilization and query performance is obtained.