Loading...
Please wait, while we are loading the content...
Similar Documents
Taking I/O Seriously: Resolution Reconsidered for Disk (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Freire, Juliana Swift, Terrance Warren, David S. |
| Description | In Proceedings of the International Conference on Logic Programming (ICLP Modern compilation techniques can give Prolog programs, in the best cases, a speed comparable to C. However, Prolog has proven to be unacceptable for data-oriented queries for two major reasons: its sometimes poor termination and complexity properties for Datalog, and its tuple-at-a-time strategy. A number of tabling frameworks and systems have addressed the first problem, most notably the XSB system which has achieved Prolog speeds for tabled programs. Yet, tabling systems such as XSB continue to use the tuple-at-a-time paradigm. As a result, these systems are not amenable to a tight interconnection with disk-resident data. However, in a tabling framework the difference between tuple-at-a-time behavior and set-at-a-time can be viewed as one of scheduling. Accordingly, we define a breadth-first set-at-a-time tabling strategy and prove it iteration equivalent to a form of semi-naive magic evaluation. That is, we extend the well-known asymptotic results of Seki [13] by proving that each ... |
| File Format | |
| Language | English |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Well-known Asymptotic Result Prolog Program Major Reason Prolog Speed Resolution Reconsidered Modern Compilation Technique Tuple-at-a-time Paradigm Disk-resident Data Sometimes Poor Termination Xsb System Tabled Program Tuple-at-a-time Strategy Complexity Property Breadth-first Set-at-a-time Tabling Strategy Tuple-at-a-time Behavior First Problem Semi-naive Magic Evaluation Tight Interconnection Data-oriented Query Tabling Framework |
| Content Type | Text |
| Resource Type | Article |
