Sciweavers

184 search results - page 26 / 37
» A new range query algorithm for Universal B-trees
Sort
View
WWW
2008
ACM
16 years 14 days ago
Geographic web usage estimation by monitoring DNS caches
DNS is one of the most actively used distributed databases on earth, accessed by millions of people every day to transparently convert host names into IP addresses and vice versa....
Hüseyin Akcan, Torsten Suel, Hervé Br&...
ICDT
2005
ACM
124views Database» more  ICDT 2005»
15 years 5 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
WWW
2009
ACM
16 years 14 days ago
Dataplorer: a scalable search engine for the data web
More and more structured information in the form of semantic data is nowadays available. It offers a wide range of new possibilities especially for semantic search and Web data in...
Haofen Wang, Qiaoling Liu, Gui-Rong Xue, Yong Yu, ...
ICMCS
1999
IEEE
119views Multimedia» more  ICMCS 1999»
15 years 4 months ago
Indexing by Shape of Image Databases Based on Extended Grid Files
In this paper, we propose an original indexing by shape of image databases based on extended grid files. We first introduce a recently developed shape description method and tailo...
Carlo Combi, Gian Luca Foresti, Massimo Francesche...
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
16 years 3 days ago
On the cell probe complexity of membership and perfect hashing
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
Rasmus Pagh