Sciweavers

184 search results - page 18 / 37
» Cache-oblivious data structures for orthogonal range searchi...
Sort
View
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
16 years 1 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
WWW
2007
ACM
16 years 13 days ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
ADL
2000
Springer
251views Digital Library» more  ADL 2000»
15 years 4 months ago
Efficient Similarity Search in Digital Libraries
Digital libraries are a core information technology. When the stored data is complex, e.g. high-resolution images or molecular protein structures, simple query types like the exac...
Christian Böhm, Bernhard Braunmüller, Ha...
SEM
2004
Springer
15 years 5 months ago
Integration of a Text Search Engine with a Java Messaging Service
Large-scale information processing applications must rapidly search through high volume streams of structured and unstructured textual data to locate useful information. Content-ba...
Justin Almquist, Ian Gorton, Jereme Haack
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 5 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner