Bloom-Based Filters for Hierarchical Data (2003)
| Venue: | 5th Workshop on Distributed Data Structures and Algorithms (WDAS ’03), Thessaloniki |
| Citations: | 10 - 4 self |
BibTeX
@INPROCEEDINGS{Koloniari03bloom-basedfilters,
author = {Georgia Koloniari and Evaggelia Pitoura},
title = {Bloom-Based Filters for Hierarchical Data},
booktitle = {5th Workshop on Distributed Data Structures and Algorithms (WDAS ’03), Thessaloniki},
year = {2003},
pages = {13--14}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we present two novel hash-based indexing structures, based on Bloom filters, called Breadth and Depth Bloom filters, which in contrast to traditional hash-based indexes, are able to summarize hierarchical data and support regular path expression queries. We describe how these structures can be used for resource discovery in peer-to-peer networks. We have implemented both structures and our experiments show that they both outperform Simple Bloom filters in discovering the appropriate resources. 1.
