Sciweavers

511 search results - page 33 / 103
» Approximate Selection Queries over Imprecise Data
Sort
View
LPNMR
2011
Springer
14 years 8 months ago
Approximations for Explanations of Inconsistency in Partially Known Multi-Context Systems
Abstract. Multi-context systems are a formalism to interlink decentralized and heterogeneous knowledge based systems (contexts), which interact via (possibly nonmonotonic) bridge r...
Thomas Eiter, Michael Fink, Peter Schüller
ICDE
2008
IEEE
166views Database» more  ICDE 2008»
16 years 7 months ago
A Clustered Index Approach to Distributed XPath Processing
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
Georgia Koloniari, Evaggelia Pitoura
ICDE
2006
IEEE
178views Database» more  ICDE 2006»
16 years 7 months ago
Characterizing and Exploiting Reference Locality in Data Stream Applications
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
Feifei Li, Ching Chang, George Kollios, Azer Besta...
JIIS
2002
141views more  JIIS 2002»
15 years 5 months ago
Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
Christian Böhm, Hans-Peter Kriegel, Thomas Se...
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park