Sciweavers

1109 search results - page 128 / 222
» Query Processing, Approximation, and Resource Management in ...
Sort
View
PVLDB
2008
116views more  PVLDB 2008»
13 years 8 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
COOPIS
1999
IEEE
14 years 1 months ago
Using Fagin's Algorithm for Merging Ranked Results in Multimedia Middleware
A distributed multimedia information system allows users to access data of different modalities, from different data sources, ranked by various combinationsof criteria. In [6], Fa...
Edward L. Wimmers, Laura M. Haas, Mary Tork Roth, ...
DEXA
2009
Springer
188views Database» more  DEXA 2009»
14 years 22 days ago
On-the-Fly Integration and Ad Hoc Querying of Life Sciences Databases Using LifeDB
Data intensive applications in Life Sciences extensively use the Hidden Web as a platform for information sharing. Access to these heterogeneous Hidden Web resources is limited thr...
Anupam Bhattacharjee, Aminul Islam, Mohammad Shafk...
GIS
2008
ACM
13 years 10 months ago
Spatial queries in disconnected mobile networks
In this paper we study in-network query processing in disconnected mobile environments, where both ad-hoc communication and infrastructure communication are available. Depending o...
Xinjuan Zhu, Bo Xu, Ouri Wolfson
CLUSTER
2009
IEEE
14 years 5 days ago
Using a cluster as a memory resource: A fast and large virtual memory on MPI
—The 64-bit OS provides ample memory address space that is beneficial for applications using a large amount of data. This paper proposes using a cluster as a memory resource for...
Hiroko Midorikawa, Kazuhiro Saito, Mitsuhisa Sato,...