Sciweavers

363 search results - page 37 / 73
» Linked Data Query Processing Strategies
Sort
View
CIKM
2005
Springer
14 years 4 months ago
Optimizing candidate check costs for bitmap indices
In this paper, we propose a new strategy for optimizing the placement of bin boundaries to minimize the cost of query evaluation using bitmap indices with binning. For attributes ...
Doron Rotem, Kurt Stockinger, Kesheng Wu
WWW
2002
ACM
14 years 11 months ago
OCTOPUS: aggressive search of multi-modality data using multifaceted knowledge base
An important trend in Web information processing is the support of multimedia retrieval. However, the most prevailing paradigm for multimedia retrieval, content-based retrieval (C...
Jun Yang 0003, Qing Li, Yueting Zhuang
EDBT
1998
ACM
155views Database» more  EDBT 1998»
14 years 3 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
ICDE
2000
IEEE
183views Database» more  ICDE 2000»
15 years 8 days ago
Accurate Estimation of the Cost of Spatial Selections
Optimizing queries that involve operations on spatial data requires estimating the selectivity and cost of these operations. In this paper, we focus on estimating the cost of spat...
Ashraf Aboulnaga, Jeffrey F. Naughton
SBBD
2007
165views Database» more  SBBD 2007»
14 years 11 days ago
Peer-to-Peer Information Search
We consider the network structure and query processing capabilities of social communities like bookmarks and photo sharing communities such as del.icio.us or flickr. A common fea...
Sebastian Michel, Josiane Xavier Parreira