![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/43865BF3-40E0-431C-A147-9F25C55B00E0 | - |
| Αναγνωριστικό | http://www.vldb.org/conf/2002/S23P02.pdf | - |
| Γλώσσα | en | - |
| Μέγεθος | 12 pages | en |
| Τίτλος | Tree pattern aggregation for scalable XML data dissemination | en |
| Δημιουργός | Chan Chee-Yong | en |
| Δημιουργός | Wenfei Fan | en |
| Δημιουργός | Felber Pascal | en |
| Δημιουργός | Garofalakis Minos | en |
| Δημιουργός | Γαροφαλακης Μινως | el |
| Δημιουργός | Rastogi Rajeev | en |
| Περίληψη | With the rapid growth of XML-document traffic on the Internet, scalable content-based dissemination of XML documents to a large, dynamic group of consumers has become an important research challenge. To indicate the type of content that they are interested in, data consumers typically specify their subscriptions using some XML pattern specification language (e.g., XPath). Given the large volume of subscribers, system scalability and efficiency mandate the ability to aggregate the set of consumer subscriptions to a smaller set of content specifications, so as to both reduce their storagespace requirements as well as speed up the documentsubscription matching process. In this paper, we provide the first systematic study of subscription aggregation where subscriptions are specified with tree patterns (an important subclass of XPath expressions). The main challenge is to aggregate an input set of tree patterns into a smaller set of generalized tree patterns such that: (1) a given space constraint on the total size of the subscriptions is met, and (2) the loss in precision (due to aggregation) during document filtering is minimized. We propose an efficient tree-pattern aggregation algorithm that makes effective use of document-distribution statistics in order to compute a precise set of aggregate tree patterns within the allotted space budget. As part of our solution, we also develop several novel algorithms for tree-pattern containment and minimization, as well as “least-upper-bound” computation for a set of tree patterns. These results are of interest in their own right, and can prove useful in other domains, such as XML query optimization. Extensive results from a prototype implementation validate our approach. | en |
| Τύπος | Δημοσίευση σε Συνέδριο | el |
| Τύπος | Conference Publication | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2015-12-01 | - |
| Ημερομηνία Δημοσίευσης | 2002 | - |
| Θεματική Κατηγορία | Databases | en |
| Βιβλιογραφική Αναφορά | C-Y Chan, W. Fan, P. Felber, M. Garofalakis and R. Rastogi, "Tree pattern aggregation for scalable XML data dissemination", in 28th International Conference on Very Large Data Bases, August 2002, pp. 826-837. | en |
Copyright © DIAS 2013
