Sciweavers

613 search results - page 13 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
CIKM
2010
Springer
14 years 8 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
SIGMOD
1995
ACM
82views Database» more  SIGMOD 1995»
15 years 1 months ago
Parallel Evaluation of Multi-Join Queries
A number of execution strategies for parallel evaluation of multi-join queries have been proposed in the literature; their performance was evaluated by simulation. In this paper w...
Annita N. Wilschut, Jan Flokstra, Peter M. G. Aper...
VLDB
2004
ACM
120views Database» more  VLDB 2004»
15 years 2 months ago
Relational link-based ranking
Link analysis methods show that the interconnections between web pages have lots of valuable information. The link analysis methods are, however, inherently oriented towards analy...
Floris Geerts, Heikki Mannila, Evimaria Terzi
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
15 years 6 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
CIKM
2005
Springer
15 years 3 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...