Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
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
Filtering search: a new approach to query answering
SIAM Journal on Computing
Computer
File structures: an analytic approach
File structures: an analytic approach
Priority search trees in secondary memory (extended abstract)
Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
Extending relational algebra to manipulate temporal data
Information Systems
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
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
The performance of a multiversion access method
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
Overlapping B+trees for temporal data
JCIT Proceedings of the fifth Jerusalem conference on Information technology
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
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
A consensus glossary of temporal database concepts
ACM SIGMOD Record
Path caching (extended abstract): a technique for optimal external searching
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The time index+: an incremental access structure for temporal databases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Fast subsequence matching in time-series databases
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
The snapshot index: an I/O-optimal access method for timeslice queries
Information Systems
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Temporal database system implementations
ACM SIGMOD Record
Temporal aggregation in active database rules
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An extensible notation for spatiotemporal index queries
ACM SIGMOD Record
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Using timestamping to optimize two phase commit
PDIS '93 Proceedings of the second international conference on Parallel and distributed information systems
PDIS '94 Proceedings of the third international conference on on Parallel and distributed information systems
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 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
Using differential techniques to efficiently support transaction time
The VLDB Journal — The International Journal on Very Large Data Bases
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
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
Efficient Indexing Methods for Temporal Relations
IEEE Transactions on Knowledge and Data Engineering
LoT: Dynamic Declustering of TSB-Tree Nodes for Parallel Access to Temporal Data
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Physical Organization of Temporal Data
Proceedings of the Third International Conference on Data Engineering
Indexing Techniques for Historical Databases
Proceedings of the Fifth International Conference on Data Engineering
The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases
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
Declustering Techniques for Parallelizing Temporal Access Structures
Proceedings of the Tenth International Conference on Data Engineering
Efficient Indexing for Constraint and Temporal Databases
ICDT '97 Proceedings of the 6th International Conference on Database Theory
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
R-Tree Based Indexing of Now-Relative Bitemporal Data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Object and File Management in the EXODUS Extensible Database System
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The Design of the POSTGRES Storage System
VLDB '87 Proceedings of the 13th 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
Exploiting A History Database for Backup
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The Design and Implementation of a Sequence Database System
VLDB '96 Proceedings of the 22th 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
M-IVTT: An Index for Bitemporal Databases
DEXA '96 Proceedings of the 7th International Conference on Database and Expert Systems Applications
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
The time relational model
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
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Time Constrained Push Strategies in Client-Server Databases
Distributed and Parallel Databases
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)
On a model of indexability and its bounds for range queries
Journal of the ACM (JACM)
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)
F4: large-scale automated forecasting using fractals
Proceedings of the eleventh international conference on Information and knowledge management
Schema versioning and database conversion techniques for bi-temporal databases
Annals of Mathematics and Artificial Intelligence
Capturing Delays and Valid Times in Data Warehouses—Towards Timely Consistent Analyses
Journal of Intelligent Information Systems - Special issue on data warehousing and knowledge discovery
Designing Access Methods for Bitemporal Databases
IEEE Transactions on Knowledge and Data Engineering
The Indispensability of Dispensable Indexes
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Indexing Valid Time Databases via B+-Trees
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
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
R-Tree Based Indexing of Now-Relative Bitemporal Data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The BT-tree: A Branched and Temporal Access Method
VLDB '00 Proceedings of the 26th 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
Processing of Spatio-Temporal Queries in Image Databases
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
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
Managing Time Consistency for Active Data Warehouse Environments
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
Data Models with Multiple Temporal Dimensions: Completing the Picture
CAiSE '01 Proceedings of the 13th International Conference on Advanced Information Systems Engineering
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Querying Mobile Objects in Spatio-Temporal Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Efficient Complex Query Support for Multiversion XML Documents
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
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
Light-Weight Indexing of General Bitemporal Data
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Journal of Computer and System Sciences - Special issue on PODS 2000
A time-evolving data structure scalable between discrete and continuous attribute modifications
Computer Science in Perspective
Incremental computation and maintenance of temporal aggregates
The VLDB Journal — The International Journal on Very Large Data Bases
Journal of Computer Science and Technology
Modeling location-based services with subject spaces
CASCON '03 Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research
Index structure for the fact table of a star-join schema and template query processing
CompSysTech '03 Proceedings of the 4th international conference conference on Computer systems and technologies: e-Learning
Approximate Temporal Aggregation
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Supporting temporal text-containment queries in temporal document databases
Data & Knowledge Engineering
Benchmarking access methods for time-evolving regional data
Data & Knowledge Engineering
An efficient method for indexing now-relative bitemporal data
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Mining, indexing, and querying historical spatiotemporal data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Range Aggregate Processing in Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
Join operations in temporal databases
The VLDB Journal — The International Journal on Very Large Data Bases
Historical spatio-temporal aggregation
ACM Transactions on Information Systems (TOIS)
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
An Indexing Method for Answering Queries on Moving Objects
Distributed and Parallel Databases
An efficient method for temporal aggregation with range-condition attributes
Information Sciences—Informatics and Computer Science: An International Journal
Efficiently processing queries on interval-and-value tuples in relational databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
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
Quantizing time series for efficient subsequence matching
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
A time machine for text search
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Efficient structural joins on indexed XML documents
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Indexing temporal XML documents
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Virtual machine time travel using continuous data protection and checkpointing
ACM SIGOPS Operating Systems Review
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
On computing temporal aggregates with range predicates
ACM Transactions on Database Systems (TODS)
Proceedings of the 17th international conference on World Wide Web
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
Temporal XML: modeling, indexing, and query processing
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
ArchIS: an XML-based approach to transaction-time temporal database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Transaction time indexing with version compression
Proceedings of the VLDB Endowment
A new approach on indexing mobile objects on the plane
Data & Knowledge Engineering
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 POINT approach to represent now in bitemporal databases
Journal of Intelligent Information Systems
Self-tuning management of update-intensive multidimensional data in clusters of workstations
The VLDB Journal — The International Journal on Very Large Data Bases
EverLast: a distributed architecture for preserving the web
Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries
An experimental performance comparison for indexing mobile objects on the plane
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Indexing mobile objects on the plane revisited
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Scalable architecture and query optimization fortransaction-time DBs with evolving schemas
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
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
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
Uncertainty for anonymity and 2-dimensional range query distortion
PSD'10 Proceedings of the 2010 international conference on Privacy in statistical databases
x-RDF-3X: fast querying, high update rates, and consistency for RDF databases
Proceedings of the VLDB Endowment
FIFO indexes for decomposable problems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
New results on two-dimensional orthogonal range aggregation in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hybrid index structures for temporal-textual web search
APWeb'11 Proceedings of the 13th Asia-Pacific web conference on Web technologies and applications
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Techniques for indexing and querying temporal observations for a collection of objects
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Improving space-efficiency in temporal text-indexing
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Stabbing horizontal segments with vertical rays
Proceedings of the twenty-eighth annual symposium on Computational geometry
An implicit approach to deal with periodically repeated medical data
Artificial Intelligence in Medicine
A new double sorting-based node splitting algorithm for R-tree
Programming and Computing Software
Index maintenance for time-travel text search
SIGIR '12 Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
A triangular decomposition access method for temporal data - TD-tree
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
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
Partial view selection for evolving social graphs
First International Workshop on Graph Data Management Experiences and Systems
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
Temporal and multi-versioned XML documents: A survey
Information Processing and Management: an International Journal
Efficient bulk updates on multiversion B-trees
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
This paper compares different indexing techniques proposed for supporting efficient access to temporal data. The comparison is based on a collection of important performance criteria, including the space consumed, update processing, and query time for representative queries. The comparison is based on worst-case analysis, hence no assumptions on data distribution or query frequencies are made. When a number of methods have the same asymptotic worst-case behavior, features in the methods that affect average case behavior are discussed. Additional criteria examined are the pagination of an index, the ability to cluster related data together, and the ability to efficiently separate old from current data (so that larger archival storage media such as write-once optical disks can be used). The purpose of the paper is to identify the difficult problems in accessing temporal data and describe how the different methods aim to solve them. A general lower bound for answering basic temporal queries is also introduced.