A Signature-Based Approach for Efficient Relationship Search on
XML Data Collections

D 2004

A Signature-Based Approach for Efficient Relationship Search on XML Data Collections

ZEZULA, Pavel, Giuseppe AMATO, Franca DEBOLE, Fausto RABITTI, Pasquale SAVINO et. al.

Basic information

Original name

A Signature-Based Approach for Efficient Relationship Search on XML Data Collections

Name in Czech

Signaturní přístup k efektivnímu hledání vytahů v kolekcích XML dokumentů

Authors

ZEZULA, Pavel (203 Czech Republic, guarantor), Giuseppe AMATO (380 Italy), Franca DEBOLE (380 Italy), Fausto RABITTI (380 Italy) and Pasquale SAVINO (380 Italy)

Edition

1. vyd. Berlin, Second International XML Database Symposium, XSym 2004, p. 82-96, 15 pp. 2004

Publisher

Springer

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Canada

Confidentiality degree

není předmětem státního či obchodního tajemství

RIV identification code

RIV/00216224:14330/04:00010283

Organization unit

Faculty of Informatics

ISBN

3-540-22969-8

UT WoS

000223656500007

Keywords in English

XML data; relationship search; index structure; performance

Abstract

ORIG CZ

V originále

We study the problem of finding relevant relationships among user defined nodes of XML documents. We define a language that determines the nodes as results of XPath expressions. The expressions are structured in a conjunctive normal form and the relationships among nodes qualifying in different conjuncts are determined as tree twigs of the searched XML documents. The query execution is supported by an auxiliary index structure called the tree signature. We have implemented a prototype system that supports this kind of searching and we have conducted numerous experiments on XML data collections. We have found the query execution very efficient, thus suitable for on-line processing. We also demonstrate the superiority of our system with respect to a previous, rather restricted, approach of finding the lowest common ancestor of pairs of XML nodes.

In Czech

Článek studuje problematiku efektivního vyhledávání vztahů ve strukturách XML dokumentů. Základem zvoleného přístupu je koncept stromové signatury. Experimenty potvrzují úspěšnost zvoleneho přístupu.

Links

MSM 143300004, plan (intention)

Name: Digitální knihovny

Investor: Ministry of Education, Youth and Sports of the CR, Digital libraries

Citovat

ZEZULA, Pavel, Giuseppe AMATO, Franca DEBOLE, Fausto RABITTI and Pasquale SAVINO. A Signature-Based Approach for Efficient Relationship Search on XML Data Collections. In Second International XML Database Symposium, XSym 2004. 1st ed. Berlin: Springer, 2004, p. 82-96. ISBN 3-540-22969-8.

@inproceedings{557791,
   author = {Zezula, Pavel and Amato, Giuseppe and Debole, Franca and Rabitti, Fausto and Savino, Pasquale},
   address = {Berlin},
   booktitle = {Second International XML Database Symposium, XSym 2004},
   edition = {1},
   keywords = {XML data; relationship search; index structure; performance},
   language = {eng},
   location = {Berlin},
   isbn = {3-540-22969-8},
   pages = {82-96},
   publisher = {Springer},
   title = {A Signature-Based Approach for Efficient Relationship Search on XML Data Collections},
   year = {2004}
}

TY  - JOUR
ID  - 557791
AU  - Zezula, Pavel - Amato, Giuseppe - Debole, Franca - Rabitti, Fausto - Savino, Pasquale
PY  - 2004
TI  - A Signature-Based Approach for Efficient Relationship Search on XML Data Collections
PB  - Springer
CY  - Berlin
SN  - 3540229698
KW  - XML data
KW  - relationship search
KW  - index structure
KW  - performance
N2  - We study the problem of finding relevant relationships among user defined nodes of XML documents. We define a language that determines the nodes as results of XPath expressions. The expressions are structured in a conjunctive normal form and the relationships among nodes qualifying in different conjuncts are determined as tree twigs of the searched XML documents. The query execution is supported by an auxiliary index structure called the tree signature. We have implemented a prototype system that supports this kind of searching and we have conducted numerous experiments on XML data collections. We have found the query execution very efficient, thus suitable for on-line processing. We also demonstrate the superiority of our system with respect to a previous, rather restricted, approach of finding the lowest common ancestor of pairs of XML nodes.
ER  -

ZEZULA, Pavel, Giuseppe AMATO, Franca DEBOLE, Fausto RABITTI and Pasquale SAVINO. A Signature-Based Approach for Efficient Relationship Search on XML Data Collections. In \textit{Second International XML Database Symposium, XSym 2004}. 1st ed. Berlin: Springer, 2004, p.~82-96. ISBN~3-540-22969-8.

Detailed Information on Publication Record