Signature File Hashing Using Term Occurrence and Query Frequencies
| dc.contributor.author | Aktug, Deniz | en_US |
| dc.contributor.author | Can, Fazli | en_US |
| dc.date.accessioned | 2008-07-22T19:31:15Z | |
| dc.date.available | 2008-07-22T19:31:15Z | |
| dc.date.issued | 1992-08-01 | en_US |
| dc.date.submitted | 2008-03-17 | en_US |
| dc.identifier.uri | http://hdl.handle.net/2374.MIA/205 | |
| dc.description.abstract | 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 databases. This study is an analysis of the effects of reflecting the term occurrence and query frequencies to signatures in LHSS. This approach relaxes the unrealistic uniform frequency assumption and lets the terms with high discriminatory power set more bits in signatures. The simulation experiments based on the derived formulas explore the amount of page savings with different occurrence and query frequency combinations at different hashing levels. The results show that the performance of LHSS improves with the hashing level and the larger is the difference between the term discriminatory power values of the terms, the higher is the retrieval efficiency. The paper also discusses the benefits of this approach to alleviate the imbalance between the levels of efficiency and relevancy in unrealistic uniform frequency assumption case. | en_US |
| dc.title | Signature File Hashing Using Term Occurrence and Query Frequencies | en_US |
| dc.type | Text | en_US |
| dc.type.genre | Report | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| fulltext.pdf | 1016.Kb |
|