Sciweavers

481 search results - page 21 / 97
» Approximate XML Query Answers
Sort
View
INEX
2004
Springer
14 years 1 months ago
If INEX Is the Answer, What Is the Question?
The INEX query languages allow the extraction of fragments from selected documents. This power is not much used in INEX queries. The paper suggests reasons why, and considers which...
Richard A. O'Keefe
VLDB
2005
ACM
129views Database» more  VLDB 2005»
14 years 1 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis
WEBDB
2005
Springer
101views Database» more  WEBDB 2005»
14 years 1 months ago
T-SIX: An Indexing System for XML Siblings
We present a system for efficient indexed querying of XML documents, enhanced with sibling operations. R-tree index proposed in [5] has a very high cost for the following-sibling...
SungRan Cho
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
13 years 11 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
SEMWEB
2010
Springer
13 years 5 months ago
Combining Approximation and Relaxation in Semantic Web Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks know...
Alexandra Poulovassilis, Peter T. Wood