Efficient algorithms for supergraph query processing on graph databases

Author： Zhang Shuo Gao Xiaofeng Wu Weili Li Jianzhong Gao Hong

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.21, Iss.2, 2011-02, pp. : 159-191

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

Abstract

Related content

ON RANGE QUERY USABILITY OF STATISTICAL DATABASES

By BRANKOVI

International Journal of Computer Mathematics, Vol. 79, Iss. 12, 2002-01 ,pp. : 1265-1271

Taylor & Francis Ltd

Access to resources Recommend Favorite

Enabling secure and efficient kNN query processing over encrypted spatial data in the cloud

SECURITY AND COMMUNICATION NETWORKS (ELECTRONIC), Vol. 8, Iss. 17, 2015-11 ,pp. : 3205-3218

John Wiley & Sons Inc

Access to resources Recommend Favorite

Natural language querying of databases: an information extraction approach in the conceptual query language

By Owei V.

International Journal of Human-Computer Studies, Vol. 53, Iss. 4, 2000-10 ,pp. : 439-492

Academic Press

Access to resources Recommend Favorite

Approximation Algorithms in Batch Processing

By Deng Xiaotie Poon Chung Keung Zhang Yuzhong

Journal of Combinatorial Optimization, Vol. 7, Iss. 3, 2003-09 ,pp. : 247-257

Springer Publishing Company

Access to resources Recommend Favorite

TWO ALGORITHMS FOR LANGUAGES RECOGNIZED BY GRAPH ALGEBRAS

By KELAREV A.V.

International Journal of Computer Mathematics, Vol. 79, Iss. 12, 2002-01 ,pp. : 1317-1327

Taylor & Francis Ltd

Access to resources Recommend Favorite