ACM Home Page
Please provide us with feedback. Feedback
An approach to XML path matching
Full text PdfPdf (209 KB)
Source
Workshop On Web Information And Data Management archive
Proceedings of the 9th annual ACM international workshop on Web information and data management table of contents
Lisbon, Portugal
SESSION: XML and semi-structured data table of contents
Pages 17-24  
Year of Publication: 2007
ISBN:978-1-59593-829-9
Authors
Alexander R. Vinson  UFRGS, Porto Alegre, Brazil
Carlos A. Heuser  UFRGS, Porto Alegre, Brazil
Altigran S. da Silva  UFAM, Manaus, Brazil
Edleno S. de Moura  UFAM, Manaus, Brazil
Sponsors
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 49,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1316902.1316906
What is a DOI?

ABSTRACT

In applications that accomplish XML data integration and XML instance querying, the problem of XML path matching plays a central role. This paper presents an approach for matching XML paths that consists of (1) PathSim, a similarity function specifically designed for matching XML paths and (2) a set of pre-processing functions to be applied to XML paths that are to be compared by a similarity function. The reported experiments demonstrate that PathSim achieves matches of higher quality than a similarity function for XML paths found in literature. The experiments further show that matches of higher quality are achieved when the proposed pre-processing functions are employed.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
M. Boyd, S. Kittivoravitkul, C. Lazanitis, P. McBrien, and N. Rizopoulos. Automed: A bav data integration system for heterogeneous data sources. In CAiSE, pages 82--97, 2004.
 
4
 
5
6
7
 
8
9
 
10
D. Kukulenz, K.-P. Herget, and J. Pauli. Improving retrieval by a similarity thesaurus based on hyperlink structure. In Databases and Applications, pages 29--34, 2005.
 
11
V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics Doklady, 10(8):707--710, 1966.
 
12
B. Liang, J. Tang, J.-Z. Li, and K. Wang. Semantic similarity based ontology cache. In APWeb, pages 250--262, 2006.
 
13
 
14
A. Nierman and H. V. Jagadish. Evaluating structural similarity in xml documents. In WebDB, pages 61--66, 2002.
 
15
T. Ogawa and N. Inuzuka. Similarity of documents using reconfiguration of thesaurus. In KES, pages 95--102, 2004.
 
16
17
 
18
 
19
Y. Wang, D. J. DeWitt, and Jyi Cai. X-diff: An effective change detection algorithm for xml documents. In ICDE, pages 519--530, 2003.
 
20
 
21
G. Wen, L. Jiang, and N. R. Shadbolt. Ontology-based similarity between text documents on manifold. In ASWC, pages 113--125, 2006.
 
22

Collaborative Colleagues:
Alexander R. Vinson: colleagues
Carlos A. Heuser: colleagues
Altigran S. da Silva: colleagues
Edleno S. de Moura: colleagues