Sciweavers

505 search results - page 36 / 101
» Approximate databases: a support tool for approximate reason...
Sort
View
VLDB
1999
ACM
118views Database» more  VLDB 1999»
14 years 3 days ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
SSD
1993
Springer
112views Database» more  SSD 1993»
13 years 12 months ago
A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems
: Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and acc...
Thomas Brinkhoff, Holger Horn, Hans-Peter Kriegel,...
GIS
2006
ACM
13 years 7 months ago
Qualitative polyline similarity testing with applications to query-by-sketch, indexing and classification
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...
Bart Kuijpers, Bart Moelans, Nico Van de Weghe
HICSS
2002
IEEE
91views Biometrics» more  HICSS 2002»
14 years 24 days ago
Evaluation of User Search in a Web-Database
The number of Web-databases has exploded during the last years. In order to justify the development of new information resources, it is essential to know if the use of existing re...
Joan C. Nordbotten, Svein Nordbotten
CINQ
2004
Springer
118views Database» more  CINQ 2004»
14 years 1 months ago
Boolean Formulas and Frequent Sets
We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclus...
Jouni K. Seppänen, Heikki Mannila