Sciweavers

2850 search results - page 33 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
12 years 11 months ago
Scalable query rewriting: a graph-based approach
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 ...
George Konstantinidis, José Luis Ambite
PODS
2010
ACM
150views Database» more  PODS 2010»
14 years 1 months ago
Understanding queries in a search database system
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...
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 8 months ago
Generating Efficient Plans for Queries Using Views
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...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
SIGMOD
2005
ACM
215views Database» more  SIGMOD 2005»
14 years 8 months ago
Nested intervals tree encoding in SQL
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
Vadim Tropashko
WWW
2005
ACM
14 years 9 months ago
Answering order-based queries over XML data
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,...