Bloom-Based Filters for Hierarchical Data

@inproceedings{Koloniari2003BloomBasedFF,
  title={Bloom-Based Filters for Hierarchical Data},
  author={Georgia Koloniari and Evaggelia Pitoura},
  year={2003}
}
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 represent hierarchical data and support 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 the traditional Bloom filters in discovering the… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS
24 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-9 of 9 references

The Index Fabric: Technical Overview

  • Brian Cooper, Moshe Shadmon
  • RightOrder Inc
  • 2001
1 Excerpt

Scalable Distributed Data Structures for Internet Service Construction

  • S. D. Gribble, E. A. Brewer, J. M. Hellerstein, D Culler
  • In Proceedings of the Fourth Symposium on…
  • 2000
1 Excerpt

Architecture for Secure Wide - Area Service Discovery

  • M. V. Ramakrishna.

Similar Papers

Loading similar papers…