Sciweavers

439 search results - page 56 / 88
» Unnesting Arbitrary Queries
Sort
View
CCCG
2006
13 years 11 months ago
2D Triangulation Representation Using Stable Catalogs
The problem of representing triangulations has been widely studied to obtain convenient encodings and space efficient data structures. In this paper we propose a new practical app...
Abdelkrim Mebarki, Luca Castelli Aleardi, Olivier ...
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 11 months ago
A linear lower bound on index size for text retrieval
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
Erik D. Demaine, Alejandro López-Ortiz
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 10 months ago
Improved Bounds and Schemes for the Declustering Problem
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
Benjamin Doerr, Nils Hebbinghaus, Sören Werth
SIGMOD
2002
ACM
108views Database» more  SIGMOD 2002»
14 years 10 months ago
An adaptive peer-to-peer network for distributed caching of OLAP results
Peer-to-Peer (P2P) systems are becoming increasingly popular as they enable users to exchange digital information by participating in complex networks. Such systems are inexpensiv...
Panos Kalnis, Wee Siong Ng, Beng Chin Ooi, Dimitri...
MM
2006
ACM
197views Multimedia» more  MM 2006»
14 years 3 months ago
Virtual observers in a mobile surveillance system
Conventional wide-area video surveillance systems use a network of fixed cameras positioned close to locations of interest. We describe an alternative and flexible approach to w...
Stewart Greenhill, Svetha Venkatesh