Sciweavers

57 search results - page 8 / 12
» Lightweight Data Indexing and Compression in External Memory
Sort
View
FOCS
2000
IEEE
15 years 3 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
14 years 10 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...
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
14 years 1 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
ESORICS
2011
Springer
13 years 10 months ago
Supporting Concurrency in Private Data Outsourcing
Abstract. With outsourcing emerging as a successful paradigm for delegating data and service management to third parties, the problem of guaranteeing proper privacy protection agai...
Sabrina De Capitani di Vimercati, Sara Foresti, St...
JIIS
2002
99views more  JIIS 2002»
14 years 10 months ago
Efficient Management of Persistent Knowledge
Although computer speed has steadily increased and memory is getting cheaper, the need for storage managers to deal efficiently with applications that cannot be held into main memo...
Dimitris G. Kapopoulos, Michael Hatzopoulos, Panag...