Sciweavers

349 search results - page 23 / 70
» Query Rewriting for Semistructured Data
Sort
View
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
16 years 3 months ago
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
Raghav Kaushik, Pradeep Shenoy, Philip Bohannon, E...
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
14 years 4 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
AICOM
2004
100views more  AICOM 2004»
15 years 1 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
VLDB
1999
ACM
97views Database» more  VLDB 1999»
15 years 6 months ago
Relational Databases for Querying XML Documents: Limitations and Opportunities
XML is fast emerging as the dominant standard for representing data in the World Wide Web. Sophisticated query engines that allow users to effectively tap the data stored in XML d...
Jayavel Shanmugasundaram, Kristin Tufte, Chun Zhan...
WISE
2007
Springer
15 years 8 months ago
On Tree Pattern Query Rewriting Using Views
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
Junhu Wang, Jeffrey Xu Yu, Chengfei Liu