Sciweavers

491 search results - page 76 / 99
» Optimizing complex queries with multiple relation instances
Sort
View
CIDR
2007
100views Algorithms» more  CIDR 2007»
13 years 9 months ago
Database Cracking
Database indices provide a non-discriminative navigational infrastructure to localize tuples of interest. Their maintenance cost is taken during database updates. In this paper, w...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
13 years 12 months ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos
INFOCOM
2002
IEEE
14 years 14 days ago
Optimizing the Topology of Bluetooth Wireless Personal Area Networks
Abstract— In this paper, we address the problem of determining an optimal topology for Bluetooth Wireless Personal Area Networks (BT-WPANs). In BT-WPANs, multiple communication c...
Marco Ajmone Marsan, Carla-Fabiana Chiasserini, An...
STOC
2006
ACM
129views Algorithms» more  STOC 2006»
14 years 7 months ago
Optimal phylogenetic reconstruction
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
Constantinos Daskalakis, Elchanan Mossel, Sé...
INFOCOM
2006
IEEE
14 years 1 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo