Evaluation of signature files as set access facilities in OODBs
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
Measuring similarity of interests for clustering web-users
ADC '01 Proceedings of the 12th Australasian database conference
MSQL: A Query Language for Database Mining
Data Mining and Knowledge Discovery
A Survey of Temporal Knowledge Discovery Paradigms and Methods
IEEE Transactions on Knowledge and Data Engineering
Association Rules... and What's Next? Towards Second Generation Data Mining Systems
ADBIS '98 Proceedings of the Second East European Symposium on Advances in Databases and Information Systems
Sequential Index Structure for Content-Based Retrieval
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
Querying multiple sets of discovered rules
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
A performance study of four index structures for set-valued attributes of low cardinality
The VLDB Journal — The International Journal on Very Large Data Bases
Interestingness measures for data mining: A survey
ACM Computing Surveys (CSUR)
On the Signature Tree Construction and Analysis
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Efficient content-based indexing of sequential data with bitmaps
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Hi-index | 0.00 |
This paper presents a comparative study of signature based indexing techniques applied to a database of temporal patterns. Temporal patterns include a set of states and relationships among the states. Signature-based indexing was used to accommodate multiple state values as well as the relationship among the states. The signature files can be implemented in different organizations and a specific implementation has its advantages and disadvantages. This study was undertaken to compare these implementations based on various criteria as listed in this paper. Specifically sequential signature files, bit-slice signature files, extendible signature hashing and signature trees were compared. The signature tree performed significantly better than Sequential and Bit-slice Signature files for content-based retrieval of temporal patterns, extendible signature hashing performed best of all the other implementations. However, the space overhead for Signature trees was significantly higher than all the other implementations.