ERA

Download the full-sized PDF of Geometric Filter: A Space and Time Efficient Lookup Table with Bounded ErrorDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3M12J

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Graduate Studies and Research, Faculty of

Collections

This file is in the following collections:

Theses and Dissertations

Geometric Filter: A Space and Time Efficient Lookup Table with Bounded Error Open Access

Descriptions

Other title
Subject/Keyword
Hash Table
Geometric Filter
Lookup Table
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Zhao, Yang
Supervisor and department
Rafiei, Davood (Computing Science)
Nascimento, Mario (Computing Science)
Examining committee member and department
Reformat, Marek (Electrical and Computer Engineering)
Salavatipour, Mohammad (Computing Science)
Department
Department of Computing Science
Specialization

Date accepted
2009-09-02T14:45:44Z
Graduation date
2009-11
Degree
Master of Science
Degree level
Master's
Abstract
Lookup tables are frequently used in many applications to store and retrieve keyvalue pairs. Designing efficient lookup tables can be challenging with constraints placed on storage, query response time and/or result accuracy. This thesis proposes Geometric filter, a lookup table with a space requirement close to the theoretical lower bound, efficient construction, fast querying speed, and guaranteed accuracy. Geometric filter consists of a sequence of hash tables, the sizes of which form a descending geometric series. Compared with its predecessor, Bloomier filter, its encoding runs two times faster, uses less memory, and it allows updates after encoding. We analyze the efficiency of the proposed lookup table in terms of its storage requirement and error bound, and run experiments on Web 1TB 5-gram dataset to evaluate its effectiveness.
Language
English
DOI
doi:10.7939/R3M12J
Rights
License granted by Yang Zhao (yzhao4@cs.ualberta.ca) on 2009-09-01T22:12:59Z (GMT): Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of the above terms. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
2014-04-29T16:44:43.260+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 865039
Last modified: 2015:10:12 16:16:26-06:00
Filename: thesis_v5.7.pdf
Original checksum: 5dd053c2f8f35cc1f9a1fe349ad6f3f4
Well formed: true
Valid: true
Page count: 85
Activity of users you follow
User Activity Date