Sciweavers

236 search results - page 40 / 48
» Multi-Dimensional Range Query over Encrypted Data
Sort
View
VLDB
2000
ACM
229views Database» more  VLDB 2000»
15 years 6 months ago
Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
Many emerging application domains require database systems to support efficient access over highly multidimensional datasets. The current state-of-the-art technique to indexing hi...
Kaushik Chakrabarti, Sharad Mehrotra
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 8 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
SEMWEB
2005
Springer
15 years 8 months ago
Benchmarking Database Representations of RDF/S Stores
Abstract. In this paper we benchmark three popular database representations of RDF/S schemata and data: (a) a schema-aware (i.e., one table per RDF/S class or property) with explic...
Yannis Theoharis, Vassilis Christophides, Gregory ...
SIGMETRICS
2010
ACM
180views Hardware» more  SIGMETRICS 2010»
15 years 1 months ago
Route oracle: where have all the packets gone?
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
Yaping Zhu, Jennifer Rexford, Subhabrata Sen, Aman...
CIKM
2010
Springer
15 years 1 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...