Linear computation of the maximum simultaneous forward and backward bisimulation for node-labeled trees

Authors:
Nils Grimsmo;Truls Amundsen Bjørklund;Magnus Lie Hetland
Affiliations:
Norwegian University of Science and Technology;Norwegian University of Science and Technology;Norwegian University of Science and Technology
Venue:
XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
Year:
2010

Citing 18
Cited 1

Three partition refinement algorithms

SIAM Journal on Computing
An implementation of an efficient algorithm for bisimulation equivalence

Science of Computer Programming
Communication and Concurrency

Communication and Concurrency
Covering indexes for branching path queries

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Index Structures for Path Expressions

ICDT '99 Proceedings of the 7th International Conference on Database Theory
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Fast Bisimulation Algorithm

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Computing simulations on finite and infinite graphs

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
D(k)-index: an adaptive structural summary for graph-structured data

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Exploiting Local Similarity for Indexing Paths in Graph-Structured Data

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Incremental maintenance of XML structural indexes

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Virtual cursors for XML joins

Proceedings of the thirteenth ACM international conference on Information and knowledge management
Updates for structure indexes

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Efficiently Querying Large XML Data Repositories: A Survey

IEEE Transactions on Knowledge and Data Engineering
XML twig pattern matching using version tree

Data & Knowledge Engineering
On the efficient search of an XML twig query in large DataGuide trees

IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
SAM: an efficient algorithm for F&B-index construction

APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
An incremental bisimulation algorithm

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science

Efficient external-memory bisimulation on DAGs

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data

Quantified Score

Hi-index	0.00

Visualization

Abstract

The F&B-index is used to speed up pattern matching in tree and graph data, and is based on the maximum F&B-bisimulation, which can be computed in loglinear time for graphs. It has been shown that the maximum F-bisimulation can be computed in linear time for DAGs. We build on this result, and introduce a linear algorithm for computing the maximum F&B-bisimulation for tree data. It first computes the maximum F-bisimulation, and then refines this to a maximal B-bisimulation. We prove that the result equals the maximum F&B-bisimulation.