Sciweavers

193 search results - page 1 / 39
» Join Reordering by Join Simulation
Sort
View
ICDE
2009
IEEE
143views Database» more  ICDE 2009»
14 years 6 months ago
Join Reordering by Join Simulation
We introduce a framework for reordering join pipelines at runtime in a database system. This framework incorporates novel techniques for simulating the execution of a join pipeline...
Chaitanya Mishra, Nick Koudas
BIRTE
2006
125views Business» more  BIRTE 2006»
13 years 8 months ago
Transaction Reordering and Grouping for Continuous Data Loading
With the increasing popularity of operational data warehousing, the ability to load data quickly and continuously into an RDBMS is becoming more and more important. However, in th...
Gang Luo, Jeffrey F. Naughton, Curt J. Ellmann, Mi...
ICRA
2008
IEEE
123views Robotics» more  ICRA 2008»
13 years 11 months ago
Exact state and covariance sub-matrix recovery for submap based sparse EIF SLAM algorithm
— This paper provides a novel state vector and covariance sub-matrix recovery algorithm for a recently developed submap based exactly sparse Extended Information Filter (EIF) SLA...
Shoudong Huang, Zhan Wang, Gamini Dissanayake
CIKM
1994
Springer
13 years 8 months ago
TID Hash Joins
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
Robert Marek, Erhard Rahm