Sciweavers

4886 search results - page 100 / 978
» Approximate Data Exchange
Sort
View
ICDT
2009
ACM
166views Database» more  ICDT 2009»
16 years 5 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 5 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
SOFSEM
2007
Springer
15 years 11 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach
150
Voted
COOPIS
2004
IEEE
15 years 8 months ago
Supporting Similarity Operations Based on Approximate String Matching on the Web
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
Eike Schallehn, Ingolf Geist, Kai-Uwe Sattler
VLDB
2000
ACM
114views Database» more  VLDB 2000»
15 years 8 months ago
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
We propose a novel index structure, A-tree (Approximation tree), for similarity search of high-dimensional data. The basic idea of the
Yasushi Sakurai, Masatoshi Yoshikawa, Shunsuke Uem...