Evaluation of access methods to text documents in office systems
Proc. of the third joint BCS and ACM symposium on Research and development in information retrieval
ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
A clause indexing system for PROLOG based on superimposed coding
Australian Computer Journal
The connection machine
A superimposed codeword indexing scheme for very large Prolog databases
Proceedings on Third international conference on logic programming
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
Issues in the architecture of a document archiver using optical disk technology
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
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
Estimating block accesses in database organizations: a closed noniterative formula
Communications of the ACM
Partial-match retrieval using indexed descriptor files
Communications of the ACM
Approximating block accesses in database organizations
Communications of the ACM
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Implementation of the substring test by hashing
Communications of the ACM
Introduction to Modern Information Retrieval
Introduction to Modern Information Retrieval
On extending the functions of a relational database system
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
The SMART Retrieval System—Experiments in Automatic Document Processing
The SMART Retrieval System—Experiments in Automatic Document Processing
Partitioned signature files: design issues and performance evaluation
ACM Transactions on Information Systems (TOIS)
Multikey access methods based on term discrimination and signature clustering
SIGIR '89 Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval
A signature access method for the Starburst database system
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Office documents on a database kernel—filing, retrieval, and archiving
COCS '90 Proceedings of the ACM SIGOIS and IEEE CS TC-OA conference on Office information systems
Using syntactic analysis in a document retrieval system that uses signature files
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
A dynamic signature technique for multimedia databases
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
Dynamic partitioning of signature files
ACM Transactions on Information Systems (TOIS)
Optimal weight assignment for signature generation
ACM Transactions on Database Systems (TODS)
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Parallelizing I/O intensive applications for a workstation cluster: a case study
ACM SIGARCH Computer Architecture News - Special issue on input/output in parallel computer systems
Evaluation of signature files as set access facilities in OODBs
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
On the signature weight in “multiple” m signature files
ACM SIGIR Forum
A new character-based indexing method using frequency data for Japanese documents
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Key-based partitioned bit-sliced signature file
ACM SIGIR Forum
Self-indexing inverted files for fast text retrieval
ACM Transactions on Information Systems (TOIS)
Inverted files versus signature files for text indexing
ACM Transactions on Database Systems (TODS)
Object-oriented retrieval mechanism for semistructured image collections
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Accessing data cubes along complex dimensions
Proceedings of the 2nd ACM international workshop on Data warehousing and OLAP
SigDAQ: an enhanced XML query optimization technique
Journal of Systems and Software
IEEE Transactions on Knowledge and Data Engineering
Efficient Signature File Methods for Text Retrieval
IEEE Transactions on Knowledge and Data Engineering
Atlas: A Nested Relational Database System for Text Applications
IEEE Transactions on Knowledge and Data Engineering
Efficiency of Nested Relational Document Database Systems
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
An Efficient Indexing Technique for Full Text Databases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
On B-Tree Indices for Skewed Distributions
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
XML Query Processing Using Signature and DTD
EC-WEB '02 Proceedings of the Third International Conference on E-Commerce and Web Technologies
New Access Index for Fast Execution of Conjunctive Queries over Text Data
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Indexing time series using signatures
Intelligent Data Analysis
Spatial similarity-based retrievals and image indexing by hierarchical decomposition
IDEAS'97 Proceedings of the 1997 international conference on International database engineering and applications symposium
The optimal size of a signature
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Both single-level and two-level indexed descriptor schemes for multikey retrieval are presented and compared. The descriptors are formed using superimposed coding techniques and stored using a bit-inversion technique. A fast-batch insertion algorithm for which the cost of forming the bit-inverted file is less than one disk access per record is presented. For large data files, it is shown that the two-level implementation is generally more efficient for queries with a small number of matching records. For queries that specify two or more values, there is a potential problem with the two-level implementation in that costs may accrue when blocks of records match the query but individual records within these blocks do not. One approach to overcoming this problem is to set bits in the descriptors based on pairs of indexed terms. This approach is presented and analyzed.