Sciweavers

286 search results - page 41 / 58
» Using MEMS-Based Storage to Boost Disk Performance
Sort
View
DAGSTUHL
2004
15 years 1 months ago
The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Y...
TKDE
2002
148views more  TKDE 2002»
14 years 11 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
CIKM
2009
Springer
15 years 4 months ago
Low-cost management of inverted files for online full-text search
In dynamic environments with frequent content updates, we require online full-text search that scales to large data collections and achieves low search latency. Several recent met...
Giorgos Margaritis, Stergios V. Anastasiadis
USENIX
1994
15 years 1 months ago
Reducing File System Latency using a Predictive Approach
Despite impressive advances in file system throughput resulting from technologies such as high-bandwidth networks and disk arrays, file system latency has not improved and in many...
Jim Griffioen, Randy Appleton
SIGMOD
1995
ACM
132views Database» more  SIGMOD 1995»
15 years 3 months ago
Efficient Optimistic Concurrency Control Using Loosely Synchronized Clocks
This paper describes an efficient optimistic concurrency control scheme for use in distributed database systems in which objects are cached and manipulated at client machines whil...
Atul Adya, Robert Gruber, Barbara Liskov, Umesh Ma...