A survey on tree matching and XML retrieval

MA Tahraoui, K Pinel-Sauvagnat, C Laitang… - Computer Science …, 2013 - Elsevier
With the increasing number of available XML documents, numerous approaches for retrieval
have been proposed in the literature. They usually use the tree representation of documents …

Strategies for positive and negative relevance feedback in image retrieval

H Muller, W Muller, S Marchand-Maillet… - Proceedings 15th …, 2000 - ieeexplore.ieee.org
Relevance feedback has been shown to be a very effective tool for enhancing retrieval
results in text retrieval. It has also been increasingly used in content-based image retrieval …

Structural XML query processing

R Bača, M Krátký, I Holubová, M Nečaský… - ACM Computing …, 2017 - dl.acm.org
Since the boom in new proposals on techniques for efficient querying of XML data is now
over and the research world has shifted its attention toward new types of data formats, we …

Indexing and querying XML using extended Dewey labeling scheme

J Lu, X Meng, TW Ling - Data & Knowledge Engineering, 2011 - Elsevier
Finding all the occurrences of a tree pattern in an XML database is a core operation for
efficient evaluation of XML queries. The Dewey labeling scheme is commonly used to label …

Mining rooted ordered trees under subtree homeomorphism

M Haghir Chehreghani, M Bruynooghe - Data Mining and Knowledge …, 2016 - Springer
Mining frequent tree patterns has many applications in different areas such as XML data,
bioinformatics and World Wide Web. The crucial step in frequent pattern mining is frequency …

Fast optimal twig joins

N Grimsmo, TA Bjørklund, ML Hetland - Proceedings of the VLDB …, 2010 - dl.acm.org
In XML search systems twig queries specify predicates on node values and on the structural
relationships between nodes, and a key operation is to join individual query node matches …

S3: Evaluation of tree-pattern XML queries supported by structural summaries

SK Izadi, T Härder, MS Haghjoo - Data & Knowledge Engineering, 2009 - Elsevier
XML queries are frequently based on path expressions where their elements are connected
to each other in a tree-pattern structure, called query tree pattern (QTP). Therefore, a key …

Systematic partitioning and labeling XML subtrees for efficient processing of XML queries in IoT environments

F Azzedin, S Mohammed, M Ghaleb, J Yazdani… - IEEE …, 2020 - ieeexplore.ieee.org
With the advent of IoT, storing, indexing and querying XML data efficiently is critical. To
minimize the cost of querying XML data, researchers have proposed many indexing …

Fast matching of twig patterns

J Li, J Wang - International Conference on Database and Expert …, 2008 - Springer
Twig pattern matching plays a crucial role in \scxml data processing. Existing twig pattern
matching algorithms can be classified into two-phase algorithms and one-phase algorithms …

The space complexity of processing XML twig queries over indexed documents

M Shalem, Z Bar-Yossef - 2008 IEEE 24th International …, 2008 - ieeexplore.ieee.org
Current twig join algorithms incur high memory costs on queries that involve child-axis
nodes. In this paper we provide an analytical explanation for this phenomenon. In a first …