Sciweavers

2635 search results - page 116 / 527
» Algorithms for the Database Layout Problem
Sort
View
VLDB
2002
ACM
108views Database» more  VLDB 2002»
15 years 3 months ago
Generic Database Cost Models for Hierarchical Memory Systems
Accurate prediction of operator execution time is a prerequisite for database query optimization. Although extensively studied for conventional disk-based DBMSs, cost modeling in ...
Stefan Manegold, Peter A. Boncz, Martin L. Kersten
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
14 years 7 months ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
16 years 4 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
VLDB
2007
ACM
155views Database» more  VLDB 2007»
15 years 10 months ago
Best Position Algorithms for Top-k Queries
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
Reza Akbarinia, Esther Pacitti, Patrick Valduriez
GIS
2005
ACM
16 years 5 months ago
Close pair queries in moving object databases
Databases of moving objects are important for air traffic control, ground traffic, and battlefield configurations. We introduce the (historical and spatial) range close-pair query...
Panfeng Zhou, Donghui Zhang, Betty Salzberg, Gene ...