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)
Multikey access methods based on superimposed coding techniques
ACM Transactions on Database Systems (TODS)
Operations and Implementation of Complex Objects
IEEE Transactions on Software Engineering
Introduction to object-oriented databases
Introduction to object-oriented databases
Signature files: an access method for documents and its analytical performance evaluation
ACM Transactions on Information Systems (TOIS)
Partial-match retrieval using indexed descriptor files
Communications of the ACM
Indexing Techniques for Queries on Nested Objects
IEEE Transactions on Knowledge and 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
Using path information for query processing in object-oriented database systems
CIKM '94 Proceedings of the third international conference on Information and knowledge management
OODB indexing by class-division
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Compressed multi-framed signature files: an index structure for fast information retrieval
Proceedings of the 1999 ACM symposium on Applied computing
Accessing data cubes along complex dimensions
Proceedings of the 2nd ACM international workshop on Data warehousing and OLAP
Efficient and tumble similar set retrieval
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Fine-granularity signature caching in object database systems
Data Engineering
Indexing web access-logs for pattern queries
Proceedings of the 4th international workshop on Web information and data management
Signature files and signature trees
Information Processing Letters
Signature-based structures for objects with set-valued attributes
Information Systems - Databases: Creation, management and utilization
Image indexing and retrieval using signature trees
Data & Knowledge Engineering
Path Dictionary: A New Access Method for Query Processing in Object-Oriented Databases
IEEE Transactions on Knowledge and Data Engineering
Divide-and-Conquer Algorithm for Computing Set Containment Joins
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
The hcC-tree: An Efficient Index Structure for Object Oriented Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Efficient Use of Signatures in Object-Oriented Database Systems
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
Adaptive algorithms for set containment joins
ACM Transactions on Database Systems (TODS)
Efficient similarity search for market basket data
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient processing of joins on set-valued attributes
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Signature Coding for Meta Objects
WISE '00 Proceedings of the First International Conference on Web Information Systems Engineering (WISE'00)-Volume 2 - Volume 2
RE-tree: an efficient index structure for regular expressions
The VLDB Journal — The International Journal on Very Large Data Bases
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
On the Signature Trees and Balanced Signature Trees
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Optimizing bitmap indices with efficient compression
ACM Transactions on Database Systems (TODS)
A new tree inclusion algorithm
Information Processing Letters
On the cost of searching signature trees
Information Processing Letters
On the top-down tree inclusion
ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
RE-Tree: an efficient index structure for regular expressions
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
On the SD-tree construction for optimal signature operations
COMPUTE '08 Proceedings of the 1st Bangalore Annual Compute Conference
A hybrid index structure for set-valued attributes using itemset tree and inverted list
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part I
A comparative study of signature based indexes for efficient retrieval of temporal patterns
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
On the general signature trees
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
An impact ordering approach for indexing fuzzy sets
Fuzzy Sets and Systems
Indexing set-valued attributes with a multi-level extendible hashing scheme
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Efficient filtering and ranking schemes for finding inclusion dependencies on the web
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
Object-oriented database systems (OODBs) need efficient support for manipulation of complex objects. In particular, support of queries involving evaluations of set predicates is often required in handling complex objects. In this paper, we propose a scheme to apply signature file techniques, which were originally invented for text retrieval, to the support of set value accesses, and quantitatively evaluate their potential capabilities. Two signature file organizations, the sequential signature file and the bit-sliced signature file, are considered and their performance is compared with that of the nested index for queries involving the set inclusion operator (⊆). We develop a detailed cost model and present analytical results clarifying their retrieval, storage, and update costs. Our analysis shows that the bit-sliced signature file is a very promising set access facility in OODBs.