Efficient processing of graph similarity queries with edit distance constraints

Author： Zhao Xiang   Xiao Chuan   Lin Xuemin   Wang Wei   Ishikawa Yoshiharu  

Publisher： Springer Publishing Company

ISSN： 1066-8888

Source： The VLDB Journal, Vol.22, Iss.6, 2013-12, pp. : 727-752

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Efficient Relational Techniques for Processing Graph Queries

By Sakr Sherif  

Journal of Computer Science and Technology, Vol. 25, Iss. 6, 2010-11 ,pp. : 1237-1255

Springer Publishing Company

Access to resources Recommend Favorite

Efficient processing of aggregation queries in sensor networks

By Hyun Dongjoon   Park No   Son Jin   Kim Myoung  

Distributed and Parallel Databases, Vol. 20, Iss. 3, 2006-11 ,pp. : 171-197

Springer Publishing Company

Access to resources Recommend Favorite

Efficient algorithms for shortest distance queries on special classes of polygons

By Sridhar R.   Han K.   Chandrasekharan N.  

Theoretical Computer Science, Vol. 140, Iss. 2, 1995-04 ,pp. : 291-300

Elsevier

Access to resources Recommend Favorite

The undecidability of the unrestricted modified edit distance

By Leung V.J.  

Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. : 203-215

Elsevier

Access to resources Recommend Favorite

Efficient Processing of Continual Range Queries for Location-Aware Mobile Services

By Wu Kun-Lung   Chen Shyh-Kwei   Yu Philip  

Information Systems Frontiers, Vol. 7, Iss. 4-5, 2005-12 ,pp. : 435-448

Springer Publishing Company

Access to resources Recommend Favorite