Konstantinos Sagonas
ABSTRACT
This paper describes the XSB system, and its use as an in-memory deductive database engine. XSB began from a Prolog foundation, and traditional Prolog systems are known to have serious deficiencies when used as database systems. Accordingly, XSB has a fundamental bottom-up extension, introduced through tabling (or memoing)[4], which makes it appropriate as an underlying query engine for deductive database systems. Because it eliminates redundant computation, the tabling extension makes XSB able to compute all modularly stratified datalog programs finitely and with polynomial data complexity. For non-stratified programs, a meta-interpreter with the same properties is provided. In addition XSB significantly extends and improves the indexing capabilities over those of standard Prolog. Finally, its syntactic basis in HiLog [2], lends it flexibility for data modelling.
The implementation of XSB derives from the WAM [25], the most common Prolog engine. XSB inherits the WAM's efficiency and can take advantage of extensive compiler technology developed for Prolog. As a result, performance comparisons indicate that XSB is significantly faster than other deductive database systems for a wide range of queries and stratified rule sets. XSB is under continuous development, and version 1.3 is available through anonymous ftp.
- 1.T. Chen, I.V. Itamakrishnan, and 1t. Itamesh. Multistage indexing algorithms for speeding Prolog execution. In JICSLP, pp. 639-653, 1992.Google Scholar
- 2.W. Chen, M. Kifer, and D.S. Warren. Hi.Log: A foundation for higher-order logic programming. JLP, 15(3):187-230, 1993. Google ScholarDigital Library
- 3.W. Chen, T. Swift, and D.S. Warren. Efficient implementation of general logical queries. SUNY at Stony Brook, 1993. Submitted.Google Scholar
- 4.W. Chen and D.S. Warren. Query Evaluation under the Well-Founded Semantics In PODS, pp. 168-179, 1993. Google ScholarDigital Library
- 5.W. Chen and D.S. Warren. Computation of stable models and its integration with logical query processing. SUNY at Stony Brook, 1993.Google Scholar
- 6.D. Chimenti, it. Gamboa, 1t. Krishnamurthy, S. Naqvi, S. Tsur, and C. Zaniolo. The LDL system prototype. IEEE Transactions on Knowledge and Data Engineering, 2:76-89, 1990. Google ScholarDigital Library
- 7.M. Deft, S. Morishita, and G. Phlpps. Design and implementation of the Glue-Nail database system. In SIGMOD 1995, pp. 147-156. Google ScholarDigital Library
- 8.P. Hsu and C. Zaniolo. A new user's impressions on LDL~~ and COITAL. Tit, ILPS'94 Workshop on Programming with Logic Databases, 1993.Google Scholar
- 9.S. Morishita. An alternating fixpoint tailored to magic programs. In PODS, pp. 123-134, 1993. Google ScholarDigital Library
- 10.J. Naughton, It. Itamakrishnan, Y. Sagiv, and J. Ullman. Argument reduction through factoring. In VLDB, pp. 173-182, 1989. Google ScholarDigital Library
- 11.T.C. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundarnenta In/orrnaticae, 1989. Google ScholarDigital Library
- 12.It. Itamakrishnan, D. Srivastava, and S. Sudarshan. CORAL: Control, relations, and logic. In VLDB, pp. 238-249, 1992. Google ScholarDigital Library
- 13.It. Itamaic#islman and J. Ullmau. A survey of research on deductive database systems. University of Wisconsin, 1993. manuscript.Google Scholar
- 14.K.A. Itoss. Modular stratification and magic sets for datalog programs with negation. In PODS, pp. 161- 171, 1990. Google ScholarDigital Library
- 15.K. Sagonas, T. Swift, and D.S. Warren. The XSB Programmer's Manual, 1993.Google Scholar
- 16.H. Seki. On the power of alexander templates. In PODS, pp. 150-159, 1989. Google ScholarDigital Library
- 17.T. Swift and D.S. Warren. XSB performance measurement. SUNY at Stony Brook, 1993.Google Scholar
- 18.T. Swift and D.S. Warren. The SLG-WAM Part I: Modularly stratified programs. Tit SUNY at Stony Brook, 1993. In preparation.Google Scholar
- 19.J. Ullman. Implementation of logical query languages for databases. A CM TODS, 10(3):289-321, 1985. Google ScholarDigital Library
- 20.$. Vaghani, K. Itamamohanorao, D. Kemp, Z. Somogyi, and P. Stuckey. Design overview of the Aditi deductive database system. In 7#h Int'l Conf. on Da#a Engineering, pp. 240-247, 1991. Google ScholarDigital Library
- 21.A. van Gelder, K.A. Ross, and :I.S. Schlipf. The wellfounded semantics for general logic programs. JA CM, 38(3), 1991. Google ScholarDigital Library
- 22.P. van Roy and A.M. Despain. High performance logic programming with the Aquarius Prolog compiler. IEEE Computer, pp. 54-68, 1992. Google ScholarDigital Library
- 23.A. Walker. Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete. JAR, 11(1):1-23, 1993.Google ScholarCross Ref
- 24.D.S. Warren. Memoing for logic programs. CA CM, 35(30):93-11, 1992. Google ScholarDigital Library
- 25.D.H.D. Warren. An abstract Prolog instruction set. Tit 309, SitI, 1983.Google Scholar
Index Terms
- XSB as an efficient deductive database engine
Recommendations
XSB as an efficient deductive database engine
This paper describes the XSB system, and its use as an in-memory deductive database engine. XSB began from a Prolog foundation, and traditional Prolog systems are known to have serious deficiencies when used as database systems. Accordingly, XSB has a ...
Clausal Deductive Databases and a General Framework for Semantics in Disjunctive Deductive Databases
FoIKS '00: Proceedings of the First International Symposium on Foundations of Information and Knowledge SystemsIn this paper we will investigate the novel concept of clausal deductive databases (cd-databases), which are special normal deductive databases - i.e. deductive databases which may contain default negation in rule bodies - over a meta-language Lcd with ...
Comments