Sciweavers

613 search results - page 76 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
WWW
2008
ACM
16 years 4 months ago
On incremental maintenance of 2-hop labeling of graphs
Recent interests on XML, Semantic Web, and Web ontology, among other topics, have sparked a renewed interest on graph-structured databases. A fundamental query on graphs is the re...
Ramadhana Bramandia, Byron Choi, Wee Keong Ng
131
Voted
EDBT
2004
ACM
122views Database» more  EDBT 2004»
16 years 3 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 4 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
KDD
2010
ACM
197views Data Mining» more  KDD 2010»
15 years 1 months ago
Semi-supervised feature selection for graph classification
The problem of graph classification has attracted great interest in the last decade. Current research on graph classification assumes the existence of large amounts of labeled tra...
Xiangnan Kong, Philip S. Yu
136
Voted
SSDBM
2008
IEEE
101views Database» more  SSDBM 2008»
15 years 10 months ago
Scalable Ubiquitous Data Access in Clustered Sensor Networks
Wireless sensor networks have drawn much attention due to their ability to monitor ecosystems and wildlife habitats. In such systems, the data should be intelligently collected to ...
Yueh-Hua Lee, Alex Thomo, Kui Wu, Valerie King