loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Oleksandr Panchenko ; Arian Treffer ; Hasso Plattner and Alexander Zeier

Affiliation: Hasso Plattner Institute for Software Systems Engineering, Germany

ISBN: 978-989-8425-76-8

Keyword(s): Query processing, Tree processing, XML database, Data storage, Algorithms.

Related Ontology Subjects/Areas/Topics: Data Engineering ; Data Management and Quality ; Data Storage and Query Processing

Abstract: A lot of tree-shaped data exists: XML documents, abstract syntax trees, hierarchies, etc. To accelerate query processing on trees stored in a relational database a pre-post-ordering can be used. It works well for locating ancestors of a single or few vertices because pre-post-ordering avoids recursive table access. However, it is slow if it comes to locating ancestors of hundreds or thousands of vertices because ancestors of each of the input vertices are located sequentially. In this paper, two novel algorithms (sort-tilt-scan and single-pass-scan) for solving this problem are proposed and compared with a näıve approach. While the sort-tilt-scan improves the performance by a constant factor, the single-pass-scan achieves a better complexity class. The performance gain is achieved because of a single table scan which can locate all result vertices by a single run. Using generated data, this paper demonstrates that the single-pass-scan is orders of magnitude faster than the näıve appro ach. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 34.204.173.36

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Panchenko, O.; Treffer, A.; Plattner, H. and Zeier, A. (2011). TWO ALGORITHMS FOR LOCATING ANCESTORS OF A LARGE SET OF VERTICES IN A TREE.In Proceedings of the 6th International Conference on Software and Database Technologies - Volume 1: ICSOFT, ISBN 978-989-8425-76-8, pages 280-285. DOI: 10.5220/0003599202800285

@conference{icsoft11,
author={Oleksandr Panchenko. and Arian Treffer. and Hasso Plattner. and Alexander Zeier.},
title={TWO ALGORITHMS FOR LOCATING ANCESTORS OF A LARGE SET OF VERTICES IN A TREE},
booktitle={Proceedings of the 6th International Conference on Software and Database Technologies - Volume 1: ICSOFT,},
year={2011},
pages={280-285},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003599202800285},
isbn={978-989-8425-76-8},
}

TY - CONF

JO - Proceedings of the 6th International Conference on Software and Database Technologies - Volume 1: ICSOFT,
TI - TWO ALGORITHMS FOR LOCATING ANCESTORS OF A LARGE SET OF VERTICES IN A TREE
SN - 978-989-8425-76-8
AU - Panchenko, O.
AU - Treffer, A.
AU - Plattner, H.
AU - Zeier, A.
PY - 2011
SP - 280
EP - 285
DO - 10.5220/0003599202800285

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.