Sciweavers

46 search results - page 3 / 10
» An Efficient Method for Performing Record Deletions and Upda...
Sort
View
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 7 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...
ICESS
2007
Springer
14 years 1 months ago
An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash Memory
Recently, NAND flash memory has been used for a storage device in various mobile computing devices such as MP3 players, mobile phones and laptops because of its shock-resistant, lo...
Hyun-Seob Lee, Sangwon Park, Ha-Joo Song, Dong-Ho ...
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 7 months ago
Indexing mobile objects using dual transformations
With the recent advances in wireless networks, embedded systems and GPS technology, databases that manage the location of moving objects have received increased interest. In this ...
George Kollios, Dimitris Papadopoulos, Dimitrios G...
JIDM
2010
155views more  JIDM 2010»
13 years 6 months ago
DeweyIDs - The Key to Fine-Grained Management of XML Documents
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
Michael Peter Haustein, Theo Härder, Christia...
EDBT
2000
ACM
13 years 12 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel