Query processing for temporal databases
T. Y. Cliff Leung, Richard R. Muntz · Proceedings - International Conference on Data Engineering · 2002
A stream processing approach for temporal query processing and optimization is discussed. Given properly sorted data, the implementation of temporal joins and semijoins as stream processors can be very effective. Also discussed are the tradeoffs among sort orders, the amount of local workspace, and multiple scans over input streams; in particular, the authors are interested in the effect of sort ordering on the local workspace. They present stream processing algorithms for various temporal joins and semijoins, and their workspace requirements for various data sort orderings. Finally, it is shown how semantic query optimization can play an important and natural role in optimization of temporal queries.>
Cited by 46 works. doi:10.1109/icde.1990.113470
Authors
References
- Maintaining knowledge about temporal intervals
- Computational Geometry--An Introduction.
- Computational Geometry
- Access path selection in a relational database management system
- Algorithms for Reporting and Counting Geometric Intersections
- Optimizing the performance of a relational algebra database interface
- Principles of Database Systems
- The temporal query language TQuel
- A taxonomy of time databases
- PROBE spatial data modeling and query processing in an image database application