Sciweavers

486 search results - page 21 / 98
» An Efficient Path Index for Querying Semi-structured Data
Sort
View
DAWAK
1999
Springer
15 years 4 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
VLDB
1998
ACM
87views Database» more  VLDB 1998»
15 years 4 months ago
Fast High-Dimensional Data Search in Incomplete Databases
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
Beng Chin Ooi, Cheng Hian Goh, Kian-Lee Tan
EDBT
2006
ACM
255views Database» more  EDBT 2006»
15 years 12 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald
TKDE
2010
190views more  TKDE 2010»
14 years 10 months ago
Effectively Indexing the Uncertain Space
—With the rapid development of various optical, infrared, and radar sensors and GPS techniques, there are a huge amount of multidimensional uncertain data collected and accumulat...
Ying Zhang, Xuemin Lin, Wenjie Zhang, Jianmin Wang...
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 5 days ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen