Sciweavers

261 search results - page 3 / 53
» An Optimization Technique for Answering Regular Path Queries
Sort
View
ICDE
2000
IEEE
138views Database» more  ICDE 2000»
14 years 6 months ago
Answering Regular Path Queries Using Views
Diego Calvanese, Giuseppe De Giacomo, Maurizio Len...
ICDE
2002
IEEE
206views Database» more  ICDE 2002»
14 years 6 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...
FQAS
2009
Springer
127views Database» more  FQAS 2009»
13 years 11 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
13 years 11 months ago
Boundedness of Regular Path Queries in Data Integration Systems
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
Gösta Grahne, Alex Thomo
DBPL
2001
Springer
115views Database» more  DBPL 2001»
13 years 9 months ago
Optimization Properties for Classes of Conjunctive Regular Path Queries
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
Alin Deutsch, Val Tannen