ACM Home Page
Please provide us with feedback. Feedback
Estimating accesses in partitioned signature file organizations
Full text PdfPdf (508 KB)
Source ACM Transactions on Information Systems (TOIS) archive
Volume 11 ,  Issue 2  (April 1993) table of contents
Pages: 133 - 142  
Year of Publication: 1993
ISSN:1046-8188
Authors
Paulo Ciaccia  Univ. of Bologna, Bologna, Italy
Pavel Zezula  Technical Univ. of Brno, Brno, Czech Republic
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 15,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/130226.145014
What is a DOI?

ABSTRACT

We show that performance of some basic methods for the partitioning of signature files, namely Quick Filter and Fixed Prefix, can be easily evaluated by means of a closed formula. The approximation is based on well-known results from probability theory, and, as shown by simulations, introduces no appreciable errors when compared with the exact, cumbersome formulas used so far. Furthermore, we prove that the exact formulas for the two methods coincide. Although this does not imply that the two methods behave in the same way, it sheds light on the way they could be compared.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
FELLER, W An Introductwn to Probabd~ty Theory and Its Apphcations Vol. 1, 3rd edition, Wiley~ New York, 1968.
3
 
4
5
 
6
LITWIN, W. Linear hashing: A new tool for files and table addressing In Proceedtngs of the 6th VLDB International Conference (Montreal, 1980), 212-223.
7
 
8
ZEZULA, P. Linear hashing for signature files. In Network Informatlon Processing Systems. Elsevier Science (North-Holland) 1989, 243 250.
9



REVIEW

"Fazli Can : Reviewer"

Quick filter (QF), or linear hashing with superimposed signatures [1], and fixed prefix (FP) [2] are two methods for signature file partitioning. QF and FP are designed for dynamic and static environments, respectively. more...

Collaborative Colleagues:
Paulo Ciaccia: colleagues
Pavel Zezula: colleagues