Sciweavers

3420 search results - page 123 / 684
» Proximity Search in Databases
Sort
View
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
14 years 17 days ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger
MOBIDE
2010
ACM
13 years 9 months ago
Direction-based spatial skylines
Traditional location-based services recommend nearest objects to the user by considering their spatial proximity. However, an object not only has its distance but also has its dir...
Xi Guo, Yoshiharu Ishikawa, Yunjun Gao
VLDB
2000
ACM
114views Database» more  VLDB 2000»
14 years 19 days 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...
KDD
1998
ACM
148views Data Mining» more  KDD 1998»
14 years 1 months ago
Group Bitmap Index: A Structure for Association Rules Retrieval
Discovery of association rules from large databases of item sets is an important data mining problem. Association rules are usually stored in relational databases for future use i...
Tadeusz Morzy, Maciej Zakrzewicz
WWW
2007
ACM
14 years 9 months ago
Towards Deeper Understanding of the Search Interfaces of the Deep Web
Many databases have become Web-accessible through form-based search interfaces (i.e., HTML forms) that allow users to specify complex and precise queries to access the underlying ...
Hai He, Weiyi Meng, Yiyao Lu, Clement T. Yu, Zongh...