ACM Computing Surveys (CSUR) - Annals of discrete mathematics, 24
Parallel free-text search on the connection machine system
Communications of the ACM - Special issue on parallelism
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)
Optimal signature extraction and information loss
ACM Transactions on Database Systems (TODS)
S-tree: a dynamic balanced signature index for office retrieval
Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval
ACM Transactions on Information Systems (TOIS)
Partial-match retrieval using indexed descriptor files
Communications of the ACM
Elements of the randomized combinatorial file structure
SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval
A Word-Parallel, Bit-Serial Signature Processor for Superimposed Coding
Proceedings of the Second International Conference on Data Engineering
An associative/parallel processor for partial match retrieval using superimposed codes
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
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)
Frame-sliced partitioned parallel signature files
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
Estimating accesses in partitioned signature file organizations
ACM Transactions on Information Systems (TOIS)
Analysis of multiterm queries in a dynamic signature file organization
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
On the signature weight in “multiple” m signature files
ACM SIGIR Forum
Key-based partitioned bit-sliced signature file
ACM SIGIR Forum
Document ranking on weight-partitioned signature files
ACM Transactions on Information Systems (TOIS)
Declustering of key-based partitioned signature files
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
Superimposing codes representing hierarchical information in web directories
Proceedings of the 3rd international workshop on Web information and data management
Signature-based structures for objects with set-valued attributes
Information Systems - Databases: Creation, management and utilization
Efficient Signature File Methods for Text Retrieval
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
Inverted files for text search engines
ACM Computing Surveys (CSUR)
Indexing time series using signatures
Intelligent Data Analysis
Context-aware nearest neighbor query on social networks
SocInfo'11 Proceedings of the Third international conference on Social informatics
| Hi-index | 0.00 |
A signature file acts as a filtering mechanism to reduce the amount of text that needs to be searched for a query. Unfortunately, the signature file itself must be exhaustively searched, resulting in degraded performance for a large file size. We propose to use a deterministic algorithm to divide a signature file into partitions, each of which contains signatures with the same “key.” The signature keys in a partition can be extracted and represented as the partition's key. The search can then be confined to the subset of partitions whose keys match the query key. Our main concern here is to study methods for obtaining the keys and their performance in terms of their ability to reduce the search space.Owing to the reduction of search space, partitioning a signature file has a direct benefit in a sequential search (single-processor) environment. In a parallel environment, search can be conducted in parallel effectively by allocating one or more partitions to a processor. Partitioning the signature tile with a deterministic method (as opposed to a random partitioning scheme) provides intraquery parallelism as well as interquery parallelism.In this paper, we outline the criteria for evaluating partitioning schemes. Three algorithms are described and studied. An analytical study of the performance of the algorithms is provided and the results are verified with simulation.