Sciweavers

2635 search results - page 50 / 527
» Algorithms for the Database Layout Problem
Sort
View
108
Voted
ISPD
2003
ACM
92views Hardware» more  ISPD 2003»
15 years 7 months ago
Benchmarking for large-scale placement and beyond
Over the last five years the VLSI Placement community achieved great strides in the understanding of placement problems, developed new high-performance algorithms, and achieved i...
Saurabh N. Adya, Mehmet Can Yildiz, Igor L. Markov...
DEXA
2008
Springer
120views Database» more  DEXA 2008»
15 years 4 months ago
Compressing Very Large Database Workloads for Continuous Online Index Selection
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...
Piotr Kolaczkowski
138
Voted
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
15 years 6 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
174
Voted
ADL
1997
Springer
171views Digital Library» more  ADL 1997»
15 years 6 months ago
Wavelet-Based Image Indexing Techniques with Partial Sketch Retrieval Capability
This paper describes WBIIS Wavelet-Based Image Indexing and Searching, a new image indexing and retrieval algorithm with partial sketch image searching capability for large imag...
James Ze Wang, Gio Wiederhold, Oscar Firschein, Sh...
118
Voted
VLDB
1994
ACM
101views Database» more  VLDB 1994»
15 years 6 months ago
New Concurrency Control Algorithms for Accessing and Compacting B-Trees
This paper initially presents a brief but fairly exhaustive survey of solutions to the concurrency control problem for B-trees. We then propose a new solution, which is characteri...
V. W. Setzer, Andrea Zisman