Sciweavers

18 search results - page 2 / 4
» Benchmarking Fulltext Search Performance of RDF Stores
Sort
View
MICRO
2003
IEEE
108views Hardware» more  MICRO 2003»
13 years 10 months ago
Reducing Design Complexity of the Load/Store Queue
With faster CPU clocks and wider pipelines, all relevant microarchitecture components should scale accordingly. There have been many proposals for scaling the issue queue, registe...
Il Park, Chong-liang Ooi, T. N. Vijaykumar
WWW
2011
ACM
13 years 2 days ago
Rewriting queries on SPARQL views
The problem of answering SPARQL queries over virtual SPARQL views is commonly encountered in a number of settings, including while enforcing security policies to access RDF data, ...
Wangchao Le, Songyun Duan, Anastasios Kementsietsi...
DMDW
2000
93views Management» more  DMDW 2000»
13 years 6 months ago
Storing auxiliary data for efficient maintenance and lineage tracing of complex views
As views in a data warehouse become more complex, the view maintenance process can become very complicated and potentially very inefficient. Storing auxiliary views in the warehou...
Yingwei Cui, Jennifer Widom
IPTPS
2003
Springer
13 years 10 months ago
On the Feasibility of Peer-to-Peer Web Indexing and Search
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of q...
Jinyang Li, Boon Thau Loo, Joseph M. Hellerstein, ...
MIE
2008
160views Healthcare» more  MIE 2008»
13 years 6 months ago
Using Medline Queries to Generate Image Retrieval Tasks for Benchmarking
Medical visual information retrieval has been a very active research area over the past ten years as an increasing amount of images is produced digitally and made available in the ...
Henning Müller, Jayashree Kalpathy-Cramer, Wi...