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
Multikey access methods based on superimposed coding techniques
ACM Transactions on Database Systems (TODS)
Partitioned signature files: design issues and performance evaluation
ACM Transactions on Information Systems (TOIS)
Dynamic partitioning of signature files
ACM Transactions on Information Systems (TOIS)
Information retrieval
Estimating accesses in partitioned signature file organizations
ACM Transactions on Information Systems (TOIS)
Selecting signature files for specific applications
Information Processing and Management: an International Journal
Concurrent frame signature files
Distributed and Parallel Databases
Bit-sliced signature files for very large text databases on a parallel machine architecture
EDBT '94 Proceedings of the 4th international conference on extending database technology: Advances in database technology
Declustering of key-based partitioned signature files
ACM Transactions on Database Systems (TODS)
Estimating block accesses in database organizations: a closed noniterative formula
Communications of the ACM
Approximating block accesses in database organizations
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
IEEE Transactions on Knowledge and Data Engineering
Hamming Filters: A Dynamic Signature File Organization for Parallel Stores
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
A new signature file organization is proposed as a combination of two orthogonal partitioning strategies, the key-based and the bit-sliced, respectively. The design results from theoretical analysis of these elementary approaches in which performance is analytically studied respecting a simplified abstract storage structure model. The new organization is able to achieve very high search performance for queries containing arbitrary number of query terms - bit-sliced (key-based) organization is good only for queries containing few (many) terms, quite bad performance is obtained in the other cases. Update performance is also discussed and a generalization of the method, able to adjust the trade-off between the search efficiency and the maintenance costs, is put forward for consideration. The proposal is also compared with similar approaches in the field of signature files.