Signature-based tree structures which have been proposed in the past do not perform well for large databases. The problem arises from the fact that they are incapable of pruning searching, especially at the upper tree levels, and thus they have decreased selectivities. In this paper, we locate a number of reasons for this problem and propose several methods for node splitting and partial-tree restructuring, which lead to improved query-response times. We have implemented all methods and we present experimental results, which indicate that the proposed methods are superior in all cases to the standard one and up to 5--10 times better for medium and higher weights in inclusive (partialmatch) queries. Additionally, we have developed new functions for the performance estimation of signature trees which, in contrast to a previous estimation function, are able to take into account the outcome of different split methods and to provide more accurate estimation.
|
1651
|
R-trees: A dynamic index structure for spatial searching
– Guttman
- 1984
|
|
1449
|
Mining association rules between sets of items in large databases
– Agrawal, Imielinski, et al.
- 1993
|
|
452
|
The R ∗ -tree: An Efficient and Robust Access Method for Points and Rectangles
– Beckmann, Kriegel, et al.
- 1990
|
|
334
|
M-tree: An efficient access method for similarity search in metric spaces
– Ciaccia, Patella, et al.
- 1997
|
|
310
|
FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets
– Faloutsos, Lin
- 1995
|
|
71
|
Signature files: An access method for documents and its analytical performance evaluation
– FALOUTSOS, S
- 1984
|
|
53
|
Evaluation of signature files as set access facilities in oodbs
– Ishikawa, Kitagawa, et al.
- 1993
|
|
43
|
S-tree: A Dynamic Balanced Signature Index for Office Retrieval
– Deppisch
- 1986
|
|
43
|
Fast hierarchical clustering and other applications of dynamic closest pairs
– Eppstein
- 1998
|
|
32
|
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates
– Helmer, Moerkotte
- 1997
|
|
27
|
A two level superimposed coding scheme for partial match retrieval
– Sacks-Davis, Ramamohanarao
- 1983
|
|
25
|
The rd-tree: An index structure for sets
– Hellerstein, Pfeffer
- 1994
|
|
22
|
Frame-Sliced Signature Files
– Lin, Faloutsos
- 1992
|
|
19
|
Advanced Database Indexing
– Manolopoulos, Theodoridis, et al.
- 1999
|
|
18
|
Partial match retrieval using indexed descriptor files
– Pfaltz, Berman, et al.
- 1980
|
|
16
|
Using Signature Files for Querying Time-Series Data
– Badal
- 1997
|
|
16
|
Signature file methods for indexing object-oriented database systems
– Lee, Lee
- 1992
|
|
16
|
Applying signatures for forward traversal query processing in object-oriented databases
– Yong, Lee, et al.
- 1994
|
|
15
|
Dynamic partitioning of signature files
– Zezula, Rabitti, et al.
- 1991
|
|
15
|
New Linear Node Splitting Algorithm for R-trees
– Ang, Tan
|
|
14
|
Declustering of key-based partitioned signature files
– Ciaccia, Tiberio, et al.
- 1996
|
|
14
|
Partitioned Signature Files: Design Issues and Performance Evaluation
– LEE, LENG
- 1989
|
|
9
|
A partitioned signature file structure for multiattribute and text retrieval
– Lee
- 1990
|
|
8
|
Signature caching techniques for information filtering in mobile en vironments. Wireless Networks
– Lee, Lee
- 1999
|
|
8
|
Comparison of signature file models with superimposed coding
– Dervos, Manolopulos, et al.
- 1998
|
|
8
|
Estimation of False Drops in Set-valued Object Retrieval with Signature Files
– Kitagawa, Fukushima, et al.
- 1993
|
|
7
|
Incorporating string search in a hypertext system: user interface and signature file design issues
– Faloutsos, Lee, et al.
- 1990
|
|
6
|
A dynamic signature technique for multimedia databases
– Rabitti, Zezula
- 1990
|
|
5
|
Signature file methods for semantic query caching
– Chidlovskii, Borghoff
- 1998
|
|
4
|
Hamming filter: A dynamic signature file organization for parallel stores
– Zezula, Ciaccia
- 1993
|
|
4
|
Design and evaluation of signature file organization incorporating vertical and horizontal decomposition schemes
– Kitagawa, Watanabe, et al.
- 1996
|
|
4
|
Performance evaluation of parallel S-trees
– Tousidou, Vassilakopoulos, et al.
- 2000
|
|
3
|
Signature path dictionary for nested object query processing
– Lee, Lee
- 1996
|
|
3
|
Parametric weighted filter: an efficient dynamic manipulation of signature files
– Bozanis, Makris, et al.
- 1995
|
|
2
|
Optimization of signature file parameters with varying record lengths
– Kocberber, Can, et al.
- 1999
|
|
2
|
Efficient handling of signature files used for objects with set-valued attributes
– Tousidou, Bozanis, et al.
- 2002
|
|
1
|
A Dynamic Signature File Declustering Method based on the Signature Difference
– Im, Yoo, et al.
- 1998
|
