Abstract
Temporal databases have been a research subject for many years, though one might wonder why so much attention has been devoted to this topic; indeed, time can easily be introduced as additional attributes in the relational model. Of course, specific operations need to be performed with temporal attributes, such as dealing with date formats, but such operations are not really problematic, and have long been available in commercial systems. Nevertheless, the feeling remains that time is special. Clearly, introducing time in a database requires some thought: Is one going to deal with valid time, transaction time, or both; is the basic unit a point or an interval; is time continuous or discrete; if discrete, what is the basic granularity? Nevertheless, once these questions have been answered, a direct representation by additional attributes appears at first to be adequate. With respect to querying, however, the need to express constraints on the time information arises in many cases, for instance in a query such as “which projects have overlapping schedules?” Moreover, when looking at the evaluation of queries, one notices that specific operations, such as compacting overlapping intervals, are necessary but are not directly supported in relational query languages.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliographic Notes
A. U. Tansel, J. Clifford, S. K. Gadia, A. Segev, and R. T. Snodgrass, editors. Temporal Databases: Theory, Design, and Implementation. Benjamin/Cummings, 1993.
M. Baudinet, J. Chomicki, and P. Wolper. Temporal deductive databases. In A. U. Tansel, J. Clifford, S. K. Gadia, A. Segev, and R. T. Snodgrass, editors, Temporal Databases: Theory, Design, and Implementation, chapter 13, pages 294–320. Benjamin/Cummings, 1993.
O. Etzion, S. Jajodia, and S. Sripada, editors. Temporal Databases: Research and Practice, volume 1399 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
J. Chomicki. Temporal query languages: A survey. In D. M. Gabbay and H. J. Ohlbach, editors, Proceedings 1st International Conference on Temporal Logics (ICTL’94), volume 827 of Lecture Notes in Computer Science, pages 506–534. Springer-Verlag, 1994.
F. Kabanza, J.-M. Stévenne, and P. Wolper. Handling infinite temporal data. In Proceedings of the 9th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’90), pages 392–403. ACM Press, 1990.
M. Baudinet, M. Niézette, and P. Wolper. On the representation of infinite temporal data and queries. In Proceedings of the 10th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS’91), pages 280–290. ACM Press, 1991.
F. Kabanza, J.-M. Stevenne, and P. Wolper. Handling infinite temporal data. Journal of Computer and System Sciences (JCSS), 51 (1): 3–17, 1995.
J. Chomicki and T. Imielinski. Temporal deductive databases and infinite objects. In Proceedings of the 7th ACM SIGACT-SIGMODSIGART Symposium on Principles of Database Systems (PODS’88), pages 61–73. ACM Press, 1988.
J. Chomicki and T. Imielinski. Relational specifications of infinite query answers. Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data (SIGMOD’89), pages 174–183, 1989.
J. Chomicki and T. Imielinski. Finite representation of infinite query answers. ACM Transactions on Databases Systems (TODS), 18 (2): 181–223, 1993.
J. R. Büchi. Weak second order logic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 6: 66–92, 1960.
J. R. Büchi. On a decision method in restricted second-order arithmetic. In Proceedings of the 1960 International Congress for Logic, Methodology, and Philosophy of Science,pages 1–12, Stanford, CA, USA, 1962. Stanford University Press.
P. Wolper and B. Boigelot. An automata-theoretic approach to Presburger arithmetic constraints. In Proceedings of the 2nd International Symposium on Static Analysis (SAS’95), volume 983 of Lecture Notes in Computer Science, pages 21–32. Springer-Verlag, 1995.
A. Cobham. On the base-dependence of sets of numbers recognizable by finite automata. Mathematical Systems Theory (MST), 3 (2): 186–192, 1969.
A. L. Semenov. Presburgerness of predicates regular in two number systems. Siberian Mathematical Journal, 18: 289–299, 1977.
A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In Proceedings of the 21st International Colloquium on Trees in Algebra and Programming (CAAP’96), volume 1059 of Lecture Notes in Computer Science, pages 30–43. Springer-Verlag, 1996.
V. Bruyère, G. Hansel, C. Michaux, and R. Villemaire. Logic and p-recognizable sets of integers. Bulletin of the Belgian Mathematical Society, 1 (2): 191–238, 1994.
B. Boigelot, S. Rassart, and P. Wolper. On the expressiveness of real and integer arithmetic automata. In Proceedings of the 25th Colloquium on Automata, Languages and Programming (ICALP’98), volume 1443 of Lecture Notes in Computer Science, pages 152–163. Springer-Verlag, 1998.
B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. PhD thesis, Université de Liège, 1998.
T. R. Shiple, J. H. Kukula, and R. K. Ranjan. A comparison of Presburger engines for EFSM reachability. In Proceedings of the 10th International Conference on Computer Aided Verification (CAV’98), volume 1427 of Lecture Notes in Computer Science, pages 280–292. Springer-Verlag, 1998.
B. Boigelot, L. Bronne, and S. Rassart. An improved reachability analysis method for strongly linear hybrid systems. In Proceedings of the 9th International Conference on Computer Aided Verification (CAV’97), volume 1254 of Lecture Notes in Computer Science, pages 167–178. Springer-Verlag, 1997.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Wolper, P. (2000). Linear Repeating Points. In: Kuper, G., Libkin, L., Paredaens, J. (eds) Constraint Databases. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04031-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-662-04031-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08542-0
Online ISBN: 978-3-662-04031-7
eBook Packages: Springer Book Archive