A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Incremental Maintenance of the Minimum Bisimulation of Cyclic Graphs
2013
IEEE Transactions on Knowledge and Data Engineering
There have been numerous recent applications of graph databases (e.g., the Semantic Web, ontology representation, social networks, XML, chemical databases and biological databases). A fundamental structural index for data graphs, namely minimum bisimulation, has been reported useful for efficient path query processing and optimization including selectivity estimation, among many others. Data graphs are subject to change and their indexes are updated accordingly. This paper studies the
doi:10.1109/tkde.2012.230
fatcat:4asnbw34nnfyjbeslrdxbj6l7q