Sciweavers

85 search results - page 3 / 17
» Fast and practical indexing and querying of very large graph...
Sort
View
KDD
2007
ACM
227views Data Mining» more  KDD 2007»
14 years 6 months ago
Fast best-effort pattern matching in large attributed graphs
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
Hanghang Tong, Christos Faloutsos, Brian Gallagher...
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 9 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
PVLDB
2010
122views more  PVLDB 2010»
13 years 4 months ago
On Graph Query Optimization in Large Networks
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Peixiang Zhao, Jiawei Han
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 7 months ago
Graph Database Indexing Using Structured Graph Decomposition
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...
David W. Williams, Jun Huan, Wei Wang 0010
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
14 years 7 months ago
Fast Indexes and Algorithms for Set Similarity Selection Queries
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...