Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Key-sequence data sets on indelible storage
IBM Journal of Research and Development
The BANG file: A new kind of grid file
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Algorithms
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
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
Toward a unified framework for version modeling in engineering databases
ACM Computing Surveys (CSUR)
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
The performance of a multiversion access method
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Efficient memory access in large-scale computation (invited paper)
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Handbook of theoretical computer science (vol. A)
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
Concurrency control in advanced database applications
ACM Computing Surveys (CSUR)
Temporal databases: theory, design, and implementation
Temporal databases: theory, design, and implementation
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
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
Indexing Techniques for Historical Databases
Proceedings of the Fifth International Conference on Data Engineering
An Implementation and Performance Analysis of Spatial Data Access Methods
Proceedings of the Fifth International Conference on Data Engineering
Efficient Implementation Techniques For the Time Index
Proceedings of the Seventh International Conference on Data Engineering
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
Overlapping linear quadtrees: a spatio-temporal access method
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
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
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
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
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)
IEEE Transactions on Computers
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
Temporal Aggregation over Data Streams Using Multiple Granularities
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Dynamic Queries over Mobile Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
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
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
An Evaluation of Generic Bulk Loading Techniques
Proceedings of the 27th 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
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
Multiversion Linear Quadtree for Spatio-Temporal Data
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Online Data Structures in External Memory
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Efficient Bulk Operations on Dynamic R-trees
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Querying Mobile Objects in Spatio-Temporal Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
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
Implementing I/O-efficient Data Structures Using TPIE
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Plug&Join: An easy-to-use Generic Algorithm for Efficiently Processing Equi and Non-Equi Joins
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
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
The LHAM log-structured history data access method
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
Incremental computation and maintenance of temporal aggregates
The VLDB Journal — The International Journal on Very Large Data Bases
Journal of Computer Science and Technology
Main Memory Evaluation of Monitoring Queries Over Moving Objects
Distributed and Parallel Databases
Adaptive cell-based index for moving objects
Data & Knowledge Engineering
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
Historical spatio-temporal aggregation
ACM Transactions on Information Systems (TOIS)
Fossilized index: the linchpin of trustworthy non-alterable electronic records
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Efficient indexing of the historical, present, and future positions of moving objects
Proceedings of the 6th international conference on Mobile data management
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)
I/O-efficient batched union-find and its applications to terrain analysis
Proceedings of the twenty-second annual symposium on Computational geometry
Indexing spatiotemporal archives
The VLDB Journal — The International Journal on Very Large Data Bases
Modeling and querying moving objects in networks
The VLDB Journal — The International Journal on Very Large Data Bases
On past-time indexing of moving objects
Journal of Systems and Software
Trustworthy keyword search for regulatory-compliant records retention
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Ursa minor: versatile cluster-based storage
FAST'05 Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4
An efficient B-tree layer implementation for flash-memory storage systems
ACM Transactions on Embedded Computing Systems (TECS)
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference 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
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
On computing temporal aggregates with range predicates
ACM Transactions on Database Systems (TODS)
A survey of persistent data structures
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Skippy: a new snapshot indexing method for time travel in the storage manager
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
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
Scalable ranked publish/subscribe
Proceedings of the VLDB Endowment
Transaction time indexing with version compression
Proceedings of the VLDB Endowment
Concurrency control and recovery for multiversion database structures
Proceedings of the 2nd PhD workshop on Information and knowledge management
Multiversion join index for multiversion data warehouse
Information and Software Technology
Sequenced spatio-temporal aggregation in road networks
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Transactions on the multiversion B+-tree
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
EverLast: a distributed architecture for preserving the web
Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries
Worst-case efficient range search indexing: invited tutorial
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
STAH-TREE: Quality Tests of Hybrid Index for Spatio-Temporal Aggregation
Proceedings of the 2008 conference on New Trends in Multimedia and Network Information 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
Enhancing the B+-tree by dynamic node popularity caching
Information Processing Letters
Modified R-MVB tree and BTV algorithm used in a distributed spatio-temporal data warehouse
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Efficient processing of 3-sided range queries with probabilistic guarantees
Proceedings of the 13th International Conference on Database Theory
BiB+-tree: an efficient multiversion access method for bitemporal databases
Proceedings of the 11th International Conference on Information Integration and Web-based Applications & Services
Logging every footstep: quantile summaries for the entire history
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
A time efficient indexing scheme for complex spatiotemporal retrieval
ACM SIGMOD Record
I/O-efficient batched union-find and its applications to terrain analysis
ACM Transactions on Algorithms (TALG)
Efficient temporal keyword search over versioned text
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Top-k queries on temporal data
The VLDB Journal — The International Journal on Very Large Data Bases
External-memory algorithms and data structures
Algorithms and theory of computation handbook
The HV-tree: a memory hierarchy aware version index
Proceedings of the VLDB Endowment
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
Stratified B-trees and versioned dictionaries
HotStorage'11 Proceedings of the 3rd USENIX conference on Hot topics in storage and file systems
Temporal index sharding for space-time efficiency in archive search
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Sequenced spatiotemporal aggregation for coarse query granularities
The VLDB Journal — The International Journal on Very Large Data Bases
Minimal data sets vs. synchronized data copies in a schema and data versioning system
Proceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Supporting temporal slicing in XML databases
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Partially persistent B-trees with constant worst-case update time
Computers and Electrical Engineering
Moving objects in networks databases
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
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
Stabbing horizontal segments with vertical rays
Proceedings of the twenty-eighth annual symposium on Computational geometry
Minuet: a scalable distributed multiversion B-tree
Proceedings of the VLDB Endowment
Index maintenance for time-travel text search
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Transaction log based application error recovery and point in-time query
Proceedings of the VLDB Endowment
I/O-efficient planar range skyline and attrition priority queues
Proceedings of the 32nd symposium on Principles of database systems
Timeline index: a unified data structure for processing queries on temporal data in SAP HANA
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Optimal splitters for temporal and multi-version databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
DeltaNI: an efficient labeling scheme for versioned hierarchical data
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Making updates disk-I/O friendly using SSDs
Proceedings of the VLDB Endowment
Storing and processing temporal data in a main memory column store
Proceedings of the VLDB Endowment
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 |
In a variety of applications, we need to keep track of the development of a data set over time. For maintaining and querying these multiversion data efficiently, external storage structures are an absolute necessity. We propose a multiversion B-tree that supports insertions and deletions of data items at the current version and range queries and exact match queries for any version, current or past. Our multiversion B-tree is asymptotically optimal in the sense that the time and space bounds are asymptotically the same as those of the (single-version) B-tree in the worst case. The technique we present for transforming a (single-version) B-tree into a multiversion B-tree is quite general: it applies to a number of hierarchical external access structures with certain properties directly, and it can be modified for others.