Sciweavers

332 search results - page 16 / 67
» Space Complexity vs. Query Complexity
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
14 years 10 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
DBISP2P
2004
Springer
150views Database» more  DBISP2P 2004»
14 years 3 months ago
Adapting the Content Native Space for Load Balanced Indexing
Today, there is an increasing demand to share data with complex data types (e.g., multi-dimensional) over large numbers of data sources. One of the key challenges is sharing these ...
Yanfeng Shu, Kian-Lee Tan, Aoying Zhou
ADBIS
1998
Springer
100views Database» more  ADBIS 1998»
14 years 2 months ago
Multiple Range Query Optimization in Spatial Databases
In order to answer efficiently range queries in 2-d R-trees, first we sort queries by means of a space filling curve, then we group them together, and finally pass them for process...
Apostolos Papadopoulos, Yannis Manolopoulos
GIS
2005
ACM
14 years 11 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
IIIX
2006
ACM
14 years 3 months ago
Slicing and dicing the information space using local contexts
In recent years there has been growing interest in faceted grouping of documents for Interactive Information Retrieval (IIR). It is suggested that faceted grouping can offer a fl...
Hideo Joho, Joemon M. Jose