Search
Now showing items 1-10 of 11
Compressed Bit-sliced Signature Files An Index Structure for Large Lexicons
(1999-04-01)
We use the signature file method to search for partially specified terms in large lexicons. To optimize efficiency, we use the concepts of the partially evaluated bit-sliced signature file method and memory resident data ...
HypIR: Hypertext Based Information Retrieval
(1992-08-01)
Information Retrieval (IR), which is also known as text or document retrieval, is the process of locating and retrieving docri)nents that are relevant to the user queries. In
hypertext environments, docuinent databases are ...
Dynamic Signature File Partitioning Based on Term Characteristics
(1992-08-01)
Signature files act as a filter on retrieval to discard a large number of non-qualifying data items. Linear hashing with superimposed signatures (LHSS) provides an effective retrieval filter to process queries in dynamic ...
Signature Files: An Integrated Access Method for Formatted and Unformatted Databases
(1993-05-01)
The signature file approach is one of the most powerful information storage and retrieval techniques which is used for finding the data objects that are relevant to the user queries. The main idea of all signature based ...
Analysis of Signature Generation Schemes for Multiterm Queries In Partitioned Signature File Environments
(1993-05-01)
Our analysis explores the performance of three superimposed signature generation schemes as they are applied to a dynamic sigrtature file organization based on linear hashing: Linear Hashing with Superinzposed Signatures ...
Analysis of Signature Generation Schemes for Multiterm Queries In Linear Hashing with Superimposed Signatures
(1995-12-01)
Signature files provide efficient retrieval of data by reflecting the essence of the data objects into bit patterns. Our analysis explores the performance of three superimposed signature generation schemes as they are ...
Experiments on the Efficiency of Cluster Searches
(1991-03-01)
The efficiency of various cluster based retrieval (CBR) strategies is analyzed. The possibility of combining CBR and inverted index search (11s) is investigated. A method for combining the two approaches is proposed and ...
Signature File Hashing Using Term Occurrence and Query Frequencies
(1992-08-01)
Signature files act as a filter on retrieval to discard a large number of non-qualifying data items. Linear hashing with superimposed signatures (LHSS) provides an effective retrieval filter to process queries in dynamic ...
Node Re-Usability in Structured Hypertext Systems
(1992-08-01)
When the size of a graph-based hyperdocument exceeds a certain limit, the graph structure gets complicated and causes navigation and document management problems. A simple solution for this problem is the structuring ofthe ...
Experiments on Incremental Clustering
(1991-08-01)
Clustering of very large document databases is essential to reduce the spacehime complexity of information retrieval. The periodic updating of clusters is required due to the dynamic nature of databases. An algorithm for ...