Sciweavers

95 search results - page 1 / 19
» General neighbour-distinguishing index of a graph
Sort
View
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
14 years 6 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
VLDB
2007
ACM
155views Database» more  VLDB 2007»
14 years 4 months ago
Towards Graph Containment Search and Indexing
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
SIGMOD
2003
ACM
239views Database» more  SIGMOD 2003»
14 years 4 months ago
D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data
To facilitate queries over semi-structured data, various structural summaries have been proposed. Structural summaries are derived directly from the data and serve as indices for ...
Chen Qun, Andrew Lim, Kian Win Ong
DM
2008
95views more  DM 2008»
13 years 4 months ago
General neighbour-distinguishing index of a graph
It is proved that edges of a graph G with no component K2 can be coloured using at most 2 log2 (G) + 1 colours so that any two adjacent vertices have distinct sets of colours of t...
Ervin Györi, Mirko Hornák, Cory Palmer...
SAC
2006
ACM
13 years 10 months ago
MTree: an XML XPath graph index
This paper introduces the MTree index algorithm, a special purpose XML XPath index designed to meet the needs of the hierarchical XPath query language. With the increasing importa...
P. Mark Pettovello, Farshad Fotouhi