Abstract
Although lists, trees, and directed acyclic graphs (dags) are of fundamental interest in computer science, they have scarcely been noticed as data types by existing database systems and database models. In this article I present query language concepts for (object-oriented) database systems offering such non-traditional data resp. object types. For the main task of such a query language, namely the specification of predicates on instances of these types, a temporal logic approach is used. For this, an existing timely oriented approach for querying lists is extended by incorporating concepts from the area of branching-time logics. This article mainly presents the logic concepts of the query language and an implementation of these concepts in an object base systems for discrete structures.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Argenton and P. Becker. Efficient retrieval of labeled binary trees. In S. Uemura and M. Yoshikawa, editors, Proceedings of the International Symposium on Advanced Database Technologies and Their Integration, pages 176–182, 1994.
P. Becker. M — an object-oriented model and method base system for discrete optimization problems. In D. Patel, Y. Sun, and S. Patel, editors, OOIS' 94 — Proceedings of the 1994 International Conference on Object Oriented Information Systems, pages 74–87. Springer, 1994.
V. Christophides, S. Abiteboul, S. Cluet, and M. Scholl. From structured documents to novel query facilities. In Proceedings of the ACM SIGMOD Conference, pages 313–324, 1994.
R. G. G. Cattell, editor. The Object Database Standard: ODMG-93. Morgan Kaufmann, 1994.
E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic spcifications. ACM TOPLAS, 8(2):244–263, 1986.
E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 16, pages 995–1072. Elsevier, 1990.
G. H. Gonnet and F. W. Tompa. Mind your grammer: a new approach to modelling text. In Proceedings of the 13th VLDB Conference, pages 339–346, 1987.
J. Richardson. Supporting lists in a data model (a timely approach). In Proceedings of the 18th VLDB Conference, pages 127–138, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Becker, P. (1995). A temporal logic based approach for querying lists, trees, and dags in databases. In: Revell, N., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1995. Lecture Notes in Computer Science, vol 978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049127
Download citation
DOI: https://doi.org/10.1007/BFb0049127
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60303-0
Online ISBN: 978-3-540-44790-0
eBook Packages: Springer Book Archive