In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
Order-based queries over XML data include XPath navigation axes such as following-sibling and following. In this paper, we present holistic algorithms that evaluate such order-bas...
Zografoula Vagena, Nick Koudas, Divesh Srivastava,...