Sciweavers

363 search results - page 26 / 73
» Experimental Evaluations of Algorithms for IP Table Minimiza...
Sort
View
ER
2005
Springer
200views Database» more  ER 2005»
14 years 1 months ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
SIGCOMM
2006
ACM
14 years 1 months ago
Virtual ring routing: network routing inspired by DHTs
This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in D...
Matthew Caesar, Miguel Castro, Edmund B. Nightinga...
PKDD
2004
Springer
131views Data Mining» more  PKDD 2004»
14 years 1 months ago
Asynchronous and Anticipatory Filter-Stream Based Parallel Algorithm for Frequent Itemset Mining
Abstract In this paper we propose a novel parallel algorithm for frequent itemset mining. The algorithm is based on the filter-stream programming model, in which the frequent item...
Adriano Veloso, Wagner Meira Jr., Renato Ferreira,...
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
14 years 9 months ago
Flow Algorithms for Parallel Query Optimization
In this paper we address the problem of minimizing the response time of a multi-way join query using pipelined (inter-operator) parallelism, in a parallel or a distributed environ...
Amol Deshpande, Lisa Hellerstein
SSD
2005
Springer
105views Database» more  SSD 2005»
14 years 1 months ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis