A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Conjunctive Query Evaluation by Search Tree Revisited
[chapter]
2004
Lecture Notes in Computer Science
The most natural and perhaps most frequently used method for testing membership of an individual tuple into a conjunctive query is based on searching trees of partial solutions, or search-trees. We investigate the question of evaluating conjunctive queries with a time-bound guarantee that is measured as a function of the size of the minimal search-tree. We provide an algorithm that, given a database ¡ , a conjunctive query
doi:10.1007/978-3-540-30570-5_4
fatcat:fuznd2tskvefxkxprztb2mtc3i