Sciweavers

2539 search results - page 67 / 508
» Updates for Structure Indexes
Sort
View
CCR
2004
153views more  CCR 2004»
14 years 11 months ago
Tree bitmap: hardware/software IP lookups with incremental updates
IP address lookup is challenging for high performance routers because it requires a longest matching prefix at speeds of up to 10 Gbps (OC-192). Existing solutions have poor updat...
Will Eatherton, George Varghese, Zubin Dittia
SPIRE
2001
Springer
15 years 4 months ago
Compaction Techniques for Nextword Indexes
Most queries to text search engines are ranked or Boolean. Phrase querying is a powerful technique for refining searches, but is expensive to implement on conventional indexes. I...
Dirk Bahle, Hugh E. Williams, Justin Zobel
ICML
2006
IEEE
16 years 21 days ago
Sequential update of ADtrees
Ingcreasingly, data-mining algorithms must deal with databases that continuously grow over time. These algorithms must avoid repeatedly scanning their databases. When database att...
Josep Roure, Andrew W. Moore
POPL
2005
ACM
16 years 6 days ago
Context logic and tree update
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
16 years 1 days ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...