Related work on P2P XML
1. Angela Bonifati's paper
Several points are worthwhile to note:
1) More specific fragments cannot be located by more general queries. For example, if the network contains two fragments "/A/B" and "/A/C", the query "/A" cannot find them; in contrast, if the network contains a fragment with path expression "/A", while the query is "/A/B", it is probably that they are matching with each other.
2) An outstanding part of the paper is the employment of fingerprinting rather than the secure hash function to encode both the peer addresses and the fragment path expressions
3) This paper provides two categories of searching functionalities, the one is the exact-match, and the other is partial-match, which does not require the exhaustiveness of the matching data, so the proposal can be treated as an informaiton retrieval model
4) Another feature of the proposal is the use of an existing structured P2P protocol (i.e. Chord)
5) The proposal supports limited operators such as /, //, and positional selector []
6) Schema-less document
2. E. Pitoura
1) Exploit the structure of XML documents
2) Using bloom filter
3) No data placement, unstructured P2P overlay network
4) Support / and //
5) Use Manhattan(Hamming) distance, the number of the bits that they differ
6) Propagation of the update
7) The organization of the peers are based on the similarity of the filters (i.e. local and merge filter) of the peers, which is called similarity-based clustering
8) The scalability is demonstrated by using experiments
9) Schema-less document
10) For descendant axis, the path is split at // and sub-paths are processed
11) Nodes in a P2P system may be organized to form various topologies, flexiblility increases
12) Threshold is needed to set up
13) The depth filter treats the elements as a whole
3. Garces
1) A generalization of Galanis and David Dewitt's work, provide a key-to-key service
2) The proposal is based on existing DHT
3) Focus on bib db scenario
4) Sibling relationship is not addressed
5) Related to a lot of user interaction, authomated possible though
6) Application dependent on the choosing of index
7) Schema-less document
Several points are worthwhile to note:
1) More specific fragments cannot be located by more general queries. For example, if the network contains two fragments "/A/B" and "/A/C", the query "/A" cannot find them; in contrast, if the network contains a fragment with path expression "/A", while the query is "/A/B", it is probably that they are matching with each other.
2) An outstanding part of the paper is the employment of fingerprinting rather than the secure hash function to encode both the peer addresses and the fragment path expressions
3) This paper provides two categories of searching functionalities, the one is the exact-match, and the other is partial-match, which does not require the exhaustiveness of the matching data, so the proposal can be treated as an informaiton retrieval model
4) Another feature of the proposal is the use of an existing structured P2P protocol (i.e. Chord)
5) The proposal supports limited operators such as /, //, and positional selector []
6) Schema-less document
2. E. Pitoura
1) Exploit the structure of XML documents
2) Using bloom filter
3) No data placement, unstructured P2P overlay network
4) Support / and //
5) Use Manhattan(Hamming) distance, the number of the bits that they differ
6) Propagation of the update
7) The organization of the peers are based on the similarity of the filters (i.e. local and merge filter) of the peers, which is called similarity-based clustering
8) The scalability is demonstrated by using experiments
9) Schema-less document
10) For descendant axis, the path is split at // and sub-paths are processed
11) Nodes in a P2P system may be organized to form various topologies, flexiblility increases
12) Threshold is needed to set up
13) The depth filter treats the elements as a whole
3. Garces
1) A generalization of Galanis and David Dewitt's work, provide a key-to-key service
2) The proposal is based on existing DHT
3) Focus on bib db scenario
4) Sibling relationship is not addressed
5) Related to a lot of user interaction, authomated possible though
6) Application dependent on the choosing of index
7) Schema-less document
posted by Q.Wang at 2:14 PM
0 Comments:
Post a Comment
<< Home