Sequential Index Structure for Content-Based Retrieval

Authors:
Maciej Zakrzewicz
Affiliations:
-
Venue:
PAKDD '01 Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining
Year:
2001

Citing 5
Cited 1

Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching

Communications of the ACM
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Model 204 Architecture and Performance

Proceedings of the 2nd International Workshop on High Performance Transaction Systems

A comparative study of signature based indexes for efficient retrieval of temporal patterns

Proceedings of the International Conference & Workshop on Emerging Trends in Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data mining applied to databases of data sequences generates a number of sequential patterns, which often require additional processing. The post-processing usually consists in searching the source databases for data sequences which contain a given sequential pattern or a part of it. This type of content-based querying is not well supported by RDBMSs, since the traditional optimization techniques are focused on exact-match querying. In this paper, we introduce a new bitmap-oriented index structure, which efficiently optimizes content-based queries on dense databases of data sequences. Our experiments show a significant improvement over traditional database accessing methods.