Sciweavers

383 search results - page 17 / 77
» Query Containment for Conjunctive Queries with Regular Expre...
Sort
View
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
14 years 2 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
FQAS
2009
Springer
127views Database» more  FQAS 2009»
14 years 3 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 ...
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 8 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
VLDB
1990
ACM
116views Database» more  VLDB 1990»
14 years 20 days ago
Factoring Augmented Regular Chain Programs
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
Peter T. Wood
DKE
2007
136views more  DKE 2007»
13 years 8 months ago
Deciding XPath containment with MSO
XPath is the standard language for addressing parts of an XML document. We present a sound and complete decision procedure for containment of XPath queries. The considered XPath f...
Pierre Genevès, Nabil Layaïda