ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Description and performance analysis of signature file methods for office filing
ACM Transactions on Information Systems (TOIS)
A signature access method for the Starburst database system
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Evaluation of signature files as set access facilities in OODBs
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Optimal signature extraction and information loss
ACM Transactions on Database Systems (TODS)
Declustering of key-based partitioned signature files
ACM Transactions on Database Systems (TODS)
S-tree: a dynamic balanced signature index for office retrieval
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
Inverted files versus signature files for text indexing
ACM Transactions on Database Systems (TODS)
Comparison of signature file models with superimposed coding
Information Processing Letters
Compressed multi-framed signature files: an index structure for fast information retrieval
Proceedings of the 1999 ACM symposium on Applied computing
Signature files: design and performance comparison of some signature extraction methods
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
Improved methods for signature-tree construction
The Computer Journal
Signature files and signature trees
Information Processing Letters
Signature-based structures for objects with set-valued attributes
Information Systems - Databases: Creation, management and utilization
Efficient Signature File Methods for Text Retrieval
IEEE Transactions on Knowledge and Data Engineering
Applying Signatures for Forward Traversal Query Processing in Object-Oriented Databases
Proceedings of the Tenth International Conference on Data Engineering
Fast Text Access Methods for Optical and Large Magnetic Disks: Designs and Performance Comparison
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Signature file hierarchies and signature graphs: a new index method for object-oriented databases
Proceedings of the 2004 ACM symposium on Applied computing
A method for speeding up text retrieval
ACM SIGMIS Database - Database techniques and models for the office environment: selected papers from the Database Week Conference
On the Signature Trees and Balanced Signature Trees
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
On the Signature Tree Construction and Analysis
IEEE Transactions on Knowledge and Data Engineering
Design of a signature file method that accounts for non-uniform occurrence and query frequencies
VLDB '85 Proceedings of the 11th international conference on Very Large Data Bases - Volume 11
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A signature-based Grid index design for main-memory RFID database applications
Journal of Systems and Software
| Hi-index | 0.00 |
Signature file based access methods initially applied on text have now been used to handle set-oriented queries in Object-Oriented Data Bases (OODB). All the proposed methods use either efficient search method or tree based intermediate data structure to filter data objects matching the query. Use of search techniques retrieves the objects by sequentially comparing the positions of 1s in it. Such methods take longer retrieval time. On the other hand tree based structures traverse multiple paths making comparison process tedious. In this paper we describe a new indexing technique for OODB using the dynamic balancing of B+ tree called SD (Signature Declustering) tree. In this work the positions of 1s in the signatures are distributed over a set of leaf nodes. Using this for a given query signature all the matching signatures can be retrieved cumulatively in a single node. Also for signature insertion and query searching an optimal search path is calculated so that the entire process is speeded up. Experiments have been conducted to analyze the time and space overhead of the SD-tree by varying the signature length and the distribution of signature weight. The study clearly indicates the advantage of fast retrieval time in a way quite different from the other methods suggested in the past.