Sciweavers

493 search results - page 4 / 99
» Graph Database Indexing Using Structured Graph Decomposition
Sort
View
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
14 years 7 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
14 years 2 months ago
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
Lei Zou, Lei Chen 0002, Huaming Zhang, Yansheng Lu...
PVLDB
2010
200views more  PVLDB 2010»
13 years 6 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
WIOPT
2010
IEEE
13 years 6 months ago
K-shell decomposition for dynamic complex networks
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
Daniele Miorandi, Francesco De Pellegrini
VLDB
2002
ACM
116views Database» more  VLDB 2002»
13 years 7 months ago
Updates for Structure Indexes
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...