A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Efficient Enumeration for Conjunctive Queries over X-underbar Structures
[chapter]
2010
Lecture Notes in Computer Science
We investigate efficient enumeration algorithms for conjunctive queries for databases over binary relations that satisfy the X property. Tree-like relations such as XPath axes or grids are natural examples of such relations. We first show that the result of an n-ary conjunctive query Q over an X structure S can be enumerated with a delay in O(n·|S|·|Q|) between two consecutive n-tuples. Then, we consider acyclic conjunctive queries and show that such queries admit an enumeration algorithm with
doi:10.1007/978-3-642-15205-4_10
fatcat:jpeof6wlezfhjebsbfqoswdbaq