Abstract
Many queries which may be useful in applications such as “data mining” and knowledge acquisition in databases cannot be expressed in traditional query languages such as SQL or Datalog because they lack the ability to query information regarding the schema of the database. We study the language DataHiLog introduced by Ross as a restriction of the language HiLog developed by Chen, Kifer and Warren. DataHiLog is still able to mix schema-level and instance-level queries, while avoiding the problem of infinite answers which can arise in HiLog. We show how the standard techniques for Datalog can be extended to provide a bottom-up evaluation mechanism for DataHiLog, and consider whether Datalog optimization techniques can also be extended to DataHiLog.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman. Magic sets and other strange ways to implement logic programs. In Proc. Fifth ACM SIGACT-SIGMOD Symp. on Principles of Databases Systems, pages 1–15, 1986.
C. Beeri and R. Ramakrishnan. On the power of magic. In Proc, Sixth ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Databases Systems, pages 269–283, 1987.
W. Chen, M. Kifer, and D. S. Warren. HiLog: A first-order semantics of higher-order logic programming constructs. In Proc. North American Conf on Logic Programming, pages 1090–1114, 1989.
W. Chen, M. Kifer, and D.S. Warren. HiLog as a platform for database languages. In R. Hull, R. Morrison, and D. Stemple, editors, Proc. 2nd Int. Workshop on Database Programming Languages, pages 315–329. Morgan Kaufmann, 1989.
W. Chen and D. S. Warren. C-Logic for complex objects. In Proc. Eighth ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Databases Systems, pages 369–378, 1989.
D. B. Kemp, D. Srivastava, and P. J. Stuckey. Magic sets and bottom-up evaluation of well-founded models. In V. Saraswat and K. Ueda, editors, Logic Programming, Proceedings of the 1991 International Symposium, pages 337–354, San Diego, USA, 1991. The MIT Press.
M. Kifer and G. Lausen. F-Logic: A higher order language for reasoning about objects, inheritance and scheme. In Proc. of the ACM SIGMOD Conf. on Management of Data, pages 134–146, 1989.
M. Kifer and J. Wu. A logic for object-oriented logic programming (Maier’s O-Logic revisited). In Proc. Eighth ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Databases Systems, pages 379–393, 1989.
J. F. Naughton, R. Ramakrishnan, Y. Sagiv, and J. D. Ullman. Argument reduction by factoring. In Proc. 15th Int. Conf. on Very Large Data Bases, pages 173–182, 1989.
J. F. Naughton, R. Ramakrishnan, Y. Sagiv, and J. D. Ullman. Efficient evaluation of right-, left-, and combined-linear rules. In Proc. ACM SIGMOD Conf. on Management of Data, pages 235–242, 1989.
J. F. Naughton and Y. Sagiv. A decidable class of bounded recursions. In Proc. Sixth ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Databases Systems, pages 227–236, 1987.
R. Ramakrishnan, D. Srivastava, and S. Sudarshan. Rule ordering in bottom-up fixpoint evaluation of logic programs. In Proc. 16th Int. Conf. on Very Large Data Bases, pages 359–371, 1990.
K. A. Ross. On negation in HiLog. In Proc. Tenth ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Databases Systems, pages 206–215, 1991.
K. A. Ross. Relations with relation names as arguments: Algebra and calculus. In Proc. Eleventh ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Databases Systems, pages 346–353, 1992.
J. M. Smith and D. C. Smith. Database abstractions: Aggregation and generalization. ACM Trans. Database Syst., 2(2):105–133, June 1977.
J. D. Ullman. Principles of Database and Knowledge-Base Systems, volume 1. Computer Science Press, Rockville, Maryland, 1988.
J. D. Ullman. Principles of Database and Knowledge-Base Systems, volume 2. Computer Science Press, Rockville, Maryland, 1989.
P. T. Wood. Factoring augmented regular chain programs. In Proc. 16th Int. Conf. on Very Large Data Bases, pages 255–263, 1990.
P. T. Wood. Syntactic characterizations of 1-bounded datalog programs. In Proc. 2nd Int. Conf on Deductive and Object-Oriented Databases, pages 208–225, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 British Computer Society
About this paper
Cite this paper
Wood, P.T. (1994). Bottom-Up Evaluation of DataHiLog. In: Paton, N.W., Williams, M.H. (eds) Rules in Database Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3225-7_24
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3225-7_24
Publisher Name: Springer, London
Print ISBN: 978-3-540-19846-8
Online ISBN: 978-1-4471-3225-7
eBook Packages: Springer Book Archive