Loading...
Please wait, while we are loading the content...
Similar Documents
Top-Down beats Bottom-Up for Constraint Extensions of Datalog (1995)
| Content Provider | CiteSeerX |
|---|---|
| Author | Toman, David |
| Description | This paper proposes an efficient method for evaluating queries over constraint databases. The method is based on a combination of top-down resolution with memoing and closed form bottom-up evaluation. In this way top-down evaluation terminates for all queries for which the bottom-up evaluation also terminates. The main advantage of the proposed method is the direct use of partially instantiated queries without the need for rewriting of the original program. The evaluation algorithm automatically propagates the necessary constraints during the computation. In addition, top-down evaluation potentially allows the use of compilation techniques developed for compilers of logic programming languages, which can make query evaluation very efficient. 1 Introduction We propose a new method for evaluating deductive queries over constraint databases (i.e., where the constraints are used to represent the information stored in generalized relations [7]). The evaluation of queries in constraint dat... |
| File Format | |
| Language | English |
| Publisher | MIT Press |
| Publisher Date | 1995-01-01 |
| Publisher Institution | In Proc. Intl. Logic Programming Symposium |
| Access Restriction | Open |
| Subject Keyword | Generalized Relation Constraint Dat Direct Use Deductive Query Query Evaluation Top-down Evaluation Original Program Constraint Extension Compilation Technique New Method Top-down Beat Bottom-up Logic Programming Language Way Top-down Evaluation Terminates Instantiated Query Main Advantage Form Bottom-up Evaluation Constraint Database Evaluation Algorithm Efficient Method Top-down Resolution Necessary Constraint Bottom-up Evaluation |
| Content Type | Text |
| Resource Type | Article |
