Sciweavers

322 search results - page 9 / 65
» Least Expected Cost Query Optimization: What Can We Expect
Sort
View
WWW
2007
ACM
14 years 9 months ago
Optimized query planning of continuous aggregation queries in dynamic data dissemination networks
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Krithi Ramamritham
ICDE
2003
IEEE
161views Database» more  ICDE 2003»
14 years 10 months ago
Structural Join Order Selection for XML Query Optimization
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
FOCS
1989
IEEE
14 years 19 days ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
IDC
2009
Springer
14 years 3 months ago
Cost of Cooperation for Scheduling Meetings
Scheduling meetings among agents can be represented as a game - the Meetings Scheduling Game (MSG). In its simplest form, the two-person MSG is shown to have a price of anarchy (Po...
Alon Grubshtein, Amnon Meisels
BNCOD
1997
111views Database» more  BNCOD 1997»
13 years 10 months ago
Improved and Optimized Partitioning Techniques in Database Query Processing
Abstract. In this paper we present two improvements to the partitioning process: 1) A new dynamic bu er management strategy is employed to increase the average block size of I/O-tr...
Kjell Bratbergsengen, Kjetil Nørvåg