Sciweavers

3020 search results - page 179 / 604
» Similarity Queries on Structured Data in Structured Overlays
Sort
View
WEBDB
2001
Springer
113views Database» more  WEBDB 2001»
15 years 11 months ago
Indexing XML Data with ToXin
Indexing schemes for semistructured data have been developed in recent years to optimize path query processing by summarizing path information. However, most of these schemes can ...
Flavio Rizzolo, Alberto O. Mendelzon
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 9 months ago
Factorised representations of query results: size bounds and readability
We introduce a representation system for relational data based on algebraic factorisation using distributivity of product over union and commutativity of product and union. We giv...
Dan Olteanu, Jakub Zavodny
COMAD
2008
15 years 8 months ago
Querying for Information Integration: How to go from an Imprecise Intent to a Precise Query?
In this paper, we address the problem of query formulation in the context of multi-domain integration of heterogeneous data on the Web. We argue that effectively tackling this pro...
Aditya Telang, Sharma Chakravarthy, Chengkai Li
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 8 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
SEMWEB
2010
Springer
15 years 4 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