Access Methods for Bi-Temporal Databases

This publication has 16 references indexed in Scilit:

• Efficient management of time-evolving databases
  IEEE Transactions on Knowledge and Data Engineering, 1995
• Fast subsequence matching in time-series databases
  ACM SIGMOD Record, 1994
• A consensus glossary of temporal database concepts
  ACM SIGMOD Record, 1994
• TSQL2 language specification
  ACM SIGMOD Record, 1994
• Fully persistent B+-trees
  ACM SIGMOD Record, 1991
• Segment indexes
  ACM SIGMOD Record, 1991
• Incremental implementation model for relational databases with transaction time
  IEEE Transactions on Knowledge and Data Engineering, 1991
• The R*-tree: an efficient and robust access method for points and rectangles
  ACM SIGMOD Record, 1990
• Searching and storing similar lists
  Journal of Algorithms, 1986
• A new approach to rectangle intersections
  International Journal of Computer Mathematics, 1983