Sciweavers

750 search results - page 147 / 150
» Aggregates in Possibilistic Databases
Sort
View
CLUSTER
2005
IEEE
14 years 3 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
SIGMETRICS
2005
ACM
110views Hardware» more  SIGMETRICS 2005»
14 years 3 months ago
Empirical evaluation of multi-level buffer cache collaboration for storage systems
To bridge the increasing processor-disk performance gap, buffer caches are used in both storage clients (e.g. database systems) and storage servers to reduce the number of slow di...
Zhifeng Chen, Yan Zhang, Yuanyuan Zhou, Heidi Scot...
DEXA
2005
Springer
148views Database» more  DEXA 2005»
14 years 3 months ago
XG: A Data-Driven Computation Grid for Enterprise-Scale Mining
In this paper we introduce a novel architecture for data processing, based on a functional fusion between a data and a computation layer. We show how such an architecture can be le...
Radu Sion, Ramesh Natarajan, Inderpal Narang, Wen-...
WEBDB
2010
Springer
168views Database» more  WEBDB 2010»
14 years 2 months ago
WikiAnalytics: Disambiguation of Keyword Search Results on Highly Heterogeneous Structured Data
Wikipedia infoboxes is an example of a seemingly structured, yet extraordinarily heterogeneous dataset, where any given record has only a tiny fraction of all possible fields. Su...
Andrey Balmin, Emiran Curtmola
EDBT
2009
ACM
116views Database» more  EDBT 2009»
14 years 2 months ago
Ranking objects based on relationships and fixed associations
Text corpora are often enhanced by additional metadata which relate real-world entities, with each document in which such entities are discussed. Such relationships are typically ...
Albert Angel, Surajit Chaudhuri, Gautam Das, Nick ...