Sciweavers

124 search results - page 1 / 25
» A novel approach for efficient supergraph query processing o...
Sort
View
EDBT
2009
ACM
132views Database» more  EDBT 2009»
13 years 11 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
14 years 4 months ago
Similarity Search on Supergraph Containment
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ry...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 2 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
14 years 6 months ago
GString: A Novel Approach for Efficient Search in Graph Databases
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...
DPD
2006
114views more  DPD 2006»
13 years 5 months ago
A novel approach to resource scheduling for parallel query processing on computational grids
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
Anastasios Gounaris, Rizos Sakellariou, Norman W. ...