Proceedings of the 1993 ACM Conference on Computer Science - CSC '93 1993
DOI: 10.1145/170791.170822
|View full text |Cite
|
Sign up to set email alerts
|

Efficient reordering of C-PROLOG

Abstract: PROLOGuses a depih-first search of an AND/OR graph to satisfy queries against its database. It searches sequentially through the clauses of a predicate whose head matches the query, trying to satisfy the goals in the clause body in a sequential left-to-right order. The ordering of clauses and goals is a major factor in the eficiency of a PROLOG program. We have developed a profiler for C-PROLOG that collects statistics including the failure rate of clauses and goals in a C-PROLOG program. These statistics are … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…As a consequence, the order of members in a conjunction radically affects performance. It is well known that putting a member with a small expected number of solutions to the first place leads to a better execution time than putting a member with a plenty of solutions [3]. This optimization technique is similar to the techniques used by the query planners of database engines [4], [5], [6], but while the database has exact knowledge about the tables (keys, indexes, table sizes, number of different values in columns), we have to make do with some statistical data.…”
Section: Base Cases Of Optimizationmentioning
confidence: 99%
“…As a consequence, the order of members in a conjunction radically affects performance. It is well known that putting a member with a small expected number of solutions to the first place leads to a better execution time than putting a member with a plenty of solutions [3]. This optimization technique is similar to the techniques used by the query planners of database engines [4], [5], [6], but while the database has exact knowledge about the tables (keys, indexes, table sizes, number of different values in columns), we have to make do with some statistical data.…”
Section: Base Cases Of Optimizationmentioning
confidence: 99%
“…Such an approach, with minor modifications, is employed in the codes B2E (Elleaume & Marechal, 1991, 1997, UR (Dejus, 1994;Dejus & Luccio, 1994), YAUP (Boyanov et al, 1994) and SPECTRA (Tanaka & Kitamura, 2001) and is also integrated in the code RADID (C. Wang & Jin, 1992;C. Wang & Xiao, 1992;C. Wang, 1993).…”
Section: Introductionmentioning
confidence: 99%
“…Wang et al, 1994), UR (Dejus, 1994;Dejus & Luccio, 1994) and SpontLight (Geisler et al, 1994) (see also (Tatchyn et al, 1986;Yagi et al, 1995)). The problem with this approach is that the large number of individual computations for single-electron radiation can sometimes be too time consuming and impractical (Tatchyn et al, 1986;C. Wang, 1993;Lumpkin et al, 1995).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation