Sciweavers

11 search results - page 1 / 3
» Main-Memory Operation Buffering for Efficient R-Tree Update
Sort
View
VLDB
2007
ACM
87views Database» more  VLDB 2007»
14 years 4 months ago
Main-Memory Operation Buffering for Efficient R-Tree Update
Laurynas Biveinis, Simonas Saltenis, Christian S. ...
PODS
2002
ACM
168views Database» more  PODS 2002»
14 years 4 months ago
Conjunctive Selection Conditions in Main Memory
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...
Kenneth A. Ross
MDM
2009
Springer
121views Communications» more  MDM 2009»
13 years 11 months ago
Lazy-Update B+-Tree for Flash Devices
— With the rapid increasing capacity of flash chips, flash-aware indexing techniques are highly desirable for flash devices. The unique features of flash memory, such as the ...
Sai Tung On, Haibo Hu, Yu Li, Jianliang Xu
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
14 years 6 months ago
Efficient Processing of XML Update Streams
This paper introduces a framework for processing continuous, exact queries over continuous update XML streams. Instead of eagerly performing the updates on cached portions of the s...
Leonidas Fegaras
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 4 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...