Sciweavers

294 search results - page 33 / 59
» Answering Regular Path Queries Using Views
Sort
View
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
12 years 10 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
COMPGEOM
1998
ACM
13 years 11 months ago
Constructing Approximate Shortest Path Maps in Three Dimensions
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
Sariel Har-Peled
ICDE
2008
IEEE
166views Database» more  ICDE 2008»
14 years 8 months ago
A Clustered Index Approach to Distributed XPath Processing
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
Georgia Koloniari, Evaggelia Pitoura
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
14 years 7 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
AICOM
2004
100views more  AICOM 2004»
13 years 7 months ago
Query rewriting with symmetric constraints
Abstract. We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous informatio...
Christoph Koch