2635 search results - page 83 / 527 » Algorithms for the Database Layout Problem |
138
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
123
click to vote
ICPP
1999
IEEE
15 years 8 months ago
1999
IEEE
Instruction fetch bandwidth is feared to be a major limiting factor to the performance of future wide-issue aggressive superscalars. In this paper, we focus on Database applicatio...
228
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
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...
214
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Many websites provide form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we explain the importance of protecting s...
147
click to vote
PRICAI
2004
Springer
15 years 9 months ago
2004
Springer
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...