Abstract
The evolution of database (DB) technology, with its origins in hierarchical databases, has currently reached the stage of matured relational DB systems and is about to grow into deductive DB systems, where logic programming — originated by the artificial intelligence (AI) community — plays a central theoretical role. Until now, however, no smooth integration of another important part of AI, namely that of heuristic search and intelligent planning, into DB technology was known. This paper contributes a first step beyond deductive DB systems towards intelligent DB systems. We describe the well-known A*-algorithm in terms of a general theoretical framework for deductive DB systems, the sloppy deltaiteration scheme, and give a generalized algorithm, called DBA*-algorithm. As an immediate consequence, heuristic search strategies for combinatorial problems become now feasible in the DB environment in a natural and efficient way. We also present a prototype implementation of the DBA*-algorithm, with the 15-Puzzle and the Traveling Salesman Problem as sample combinatorial problems. The benchmark results gained from this testbed demonstrate the applicability and efficiency of our approach for heuristic search in deductive DB systems.
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.
Similar content being viewed by others
Literature
Aho, A.; Hopcroft, J.; Ullman, J.: The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.
Aho, A.; Ullman, J.: Universality of Data Retrieval Languages, 6th ACM Symposium on Principles of Programming Languages, 1979, pp. 110–120.
Bancilhon, F.: Naive Evaluation of Recursively Defined Relations, in On Knowledge Base Management Systems, Brodie and Mylopoulos, eds, Springer, 1986, pp. 120–129.
Bancilhon, F.; Ramakrishan, R.: An amateurs introduction to recursive query processing strategies, ACM SIGMOD, Washington, May 1986, pp. 16–52.
Bayer, R.: Database Technology for Expert Systems, Internationaler GI-Kongress 85, Wissensbasierte Systeme, Informatik Fachberichte 112, Springer Verlag, 1985, pp. 1–16.
Beeri, C; Naqvi, S.; Ramakrishnan, R.; Shmueli, O.; Tsur, S.: Sets and Negation in a Logic Database Language (LDL1), 6th ACM Symposium on Principles of Database Systems, San Diego, March, 1987, pp. 21–37.
Balbin, J.; Ramamohanarao, K.: A Generalization of the Differential Approach to Recursive Query Evaluation, Journal of Logic Programming, Vol. 4, No. 3, Sept. 1987, pp. 259–262.
Güntzer, U.; Kiessling, W.; Bayer, R.: On the Evaluation of Recursion in (Deductive) Database Systems by Efficient Differential Fixpoint Iteration, 3rd International Conference on Data Engineering, Los Angeles, Febr. 1987, pp. 120–129.
Kung, R.; Hanson, E.; Ioannidis, Y.; Sellis, T.; Shapiro, L.; Stonebraker, M.: Heuristic Search in Data Base Systems, 1st International Workshop on Expert Database Systems, Kiawah Island, Oct. 1984, pp. 96–107.
Korf, R.: Depth-First Iterative-Deepening: An Optimal Admissible Tree Search, Artificial Intelligence 27,1985, pp. 97–109.
Lloyd, J.W.: Foundations of Logic Programming, Springer Verlag, 1987.
Morris, K.; Ullman, J.; van Gelder, A.: Design Overview of the NAIL! system, 3rd International Conference on Logic Programming, London, 1986, pp. 554–568.
Nilsson, N.: Principles of Artificial Intelligence, Tioga, 1980.
Pearl, J.: Heuristics, Addison-Wesley, 1984.
Sacca, D.; Zaniolo, C: On the Implementation of a Simple Class of Logic Queries for Databases, ACM SIGMOD, Washington, May 1986, pp. 16–23.
Schmidt, H.; Kiessling, W.; Güntzer, U.; Bayer, R.: Compiling Exploratory and Goal-Directed Deduction into Sloppy Delta-Iteration, 4th IEEE Symposium on Logic Programming, San Francisco, Sept. 1987, pp. 234–243.
Steger, N.; Schmidt, H.; Güntzer, U.; Kiessling, W.: Semantics and Efficient Compilation for Quantitative Deductive Databases, 5th International Conference on Data Engineering, Los Angeles, Febr. 1989.
Ullman, J.: Implementations of Logical Query Languages for Databases, ACM Transactions on Database Systems, Vol. 10, No. 3, Sept. 1985, pp. 289–321.
van Emden, M.; Kowalski, R.: Semantics of Predicate Logic as a Programming Language, Journal ACM, 23,4, Oct. 1976, pp. 733–742.
Vieille, L.: From QSQ to QoSaQ: Global Optimization of Recursive Queries, 2nd International Conference on Expert Database Systems, Tysons Corner, April 1988, pp. 421–436.
Zaniolo, C: The Representation and Deductive Retrieval of Complex Objects, VLDB 85, Stockholm, 1985, pp. 458–469.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmidt, H., Kiessling, W., Güntzer, U., Bayer, R. (1989). DBA*: Solving Combinatorial Problems with Deductive Databases. In: Härder, T. (eds) Datenbanksysteme in Büro, Technik und Wissenschaft. Informatik-Fachberichte, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74571-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-74571-3_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50894-6
Online ISBN: 978-3-642-74571-3
eBook Packages: Springer Book Archive