Sciweavers

1091 search results - page 45 / 219
» Approximation in Databases
Sort
View
ISSADS
2005
Springer
15 years 5 months ago
Extending Databases to Precision-Controlled Retrieval of Qualitative Information
A hierarchy is an arrangement of qualitative values in a tree with certain properties. Hierarchies allow to define the confusion conf(r, s) in using qualitative value r instead of ...
Victor-Polo de Gyves, Adolfo Guzmán-Arenas,...
SIGMOD
1989
ACM
94views Database» more  SIGMOD 1989»
15 years 3 months ago
Redundancy in Spatial Databases
Spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usually require the use of approximations that can be arbitrarily bad. This leads ...
Jack A. Orenstein
EDBT
2004
ACM
121views Database» more  EDBT 2004»
15 years 12 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
15 years 12 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
PODS
2008
ACM
159views Database» more  PODS 2008»
15 years 12 months ago
Approximation algorithms for clustering uncertain data
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
Graham Cormode, Andrew McGregor