Counting twig matches in a tree

Describes efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e. a twig, in a large node-labeled tree, using a summary data structure. This problem is of interest for queries on XML and other hierarchical data, to provide query feedback and for cost-b...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Zhiyuan Chen, Jagadish, H.V., Flip Korn, Koudas, N., Muthukrishnan, S., Ng, R., Srivastava, D.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Data structures Database languages Feedback File systems Frequency Query processing Robustness Tree data structures XML
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!