A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Efficient Cache Answerability for XPath Queries
[chapter]
2003
Lecture Notes in Computer Science
The problem of cache answerability has traditionally been studied over conjunctive queries performed on top of a relational database system. However, with the proliferation of semistructured data and, in particular, of XML as the de facto standard for information interchange on the Internet, most of the assumptions and methods used for traditional systems -and cache answerability is no exception -need to be revisited from the point of view of the semistructured data and query model. In this
doi:10.1007/3-540-36556-7_16
fatcat:s24pb6655fhvzdu2otuz4x6gzu