Sciweavers

13 search results - page 1 / 3
» B-tree indexes for high update rates
Sort
View
VLDB
1992
ACM
137views Database» more  VLDB 1992»
13 years 9 months ago
Random Sampling from Pseudo-Ranked B+ Trees
In the past, two basic approaches for sampling f5-om B+ trees have been suggested: sampling from the ranked trees and acceptance/rejection sampling i?om non-ranked trees. The firs...
Gennady Antoshenkov
SIGMOD
2006
ACM
138views Database» more  SIGMOD 2006»
14 years 5 months ago
B-tree indexes for high update rates
ct In some applications, data capture dominates query processing. For example, monitoring moving objects often requires more insertions and updates than queries. Data gathering usi...
Goetz Graefe
SSD
2009
Springer
180views Database» more  SSD 2009»
13 years 11 months ago
Indexing Moving Objects Using Short-Lived Throwaway Indexes
With the exponential growth of moving objects data to the Gigabyte range, it has become critical to develop effective techniques for indexing, updating, and querying these massive ...
Jens Dittrich, Lukas Blunschi, Marcos Antonio Vaz ...
ADBIS
2003
Springer
173views Database» more  ADBIS 2003»
13 years 10 months ago
UCYMICRA: Distributed Indexing of the Web Using Migrating Crawlers
Due to the tremendous increase rate and the high change frequency of Web documents, maintaining an up-to-date index for searching purposes (search engines) is becoming a challenge....
Odysseas Papapetrou, Stavros Papastavrou, George S...
GEOINFORMATICA
2006
133views more  GEOINFORMATICA 2006»
13 years 4 months ago
Indexing Fast Moving Objects for kNN Queries Based on Nearest Landmarks
With the rapid advancements in positioning technologies such as the Global Positioning System (GPS) and wireless communications, the tracking of continuously moving objects has bec...
Dan Lin, Rui Zhang 0003, Aoying Zhou