Search

Your search keyword '"Jamard, Clement"' showing total 4 results
Start Over Author "Jamard, Clement"
4 results on '"Jamard, Clement"'

1. Extending an XML Mediator with Text Query

Author

Jamard, Clément, Gardarin, Georges, van der Aalst, Wil, editor, Mylopoulus, John, editor, Sadeh, Norman M., editor, Shaw, Michael J., editor, Szyperski, Clemens, editor, Filipe, Joaquim, editor, Cordeiro, José, editor, and Pedrosa, Vitor, editor

Published
2007
Full Text
View/download PDF

2. Indexing Textual XML in P2P Networks Using Distributed Bloom Filters

Author

Jamard, Clement, Gardarin, Georges, Yeh, Laurent, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Kotagiri, Ramamohanarao, editor, Krishna, P. Radha, editor, Mohania, Mukesh, editor, and Nantajeewarawat, Ekawit, editor

Published
2007
Full Text
View/download PDF

4. Indexing Textual XML in P2P Networks Using Distributed Bloom Filters.

Author

Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Kotagiri, Ramamohanarao, Krishna, P. Radha, Mohania, Mukesh, Nantajeewarawat, Ekawit, and Jamard, Clement

Abstract

Nowadays P2P information systems can be considered as large scale databases where all peers can store and query data in the network. Keywords and structure indexes must be maintained. However, indexing XML documents with massive set of words brings out a major problem: The number of entries to be shipped in the network is huge. We define Distributed Bloom Filter, a data structure derived from Bloom Filters, a probabilistic data structure to test whether an element is member of a set, to summarize peer XML content and structure. Our strength is to split the traditional Bloom Filter into several segments. We rely on a DHT network to distribute these segments in a P2P network. Our measurements show that our indexing method is scalable for a large number of words, and outperforms similar methods. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results