Sciweavers

1532 search results - page 109 / 307
» Querying Distributed Data in a Super-Peer Based Architecture
Sort
View
EUROPAR
1998
Springer
15 years 10 months ago
Analysing an SQL Application with a BSPlib Call-Graph Profiling Tool
This paper illustrates the use of a post-mortem call-graph profiling tool in the analysis of an SQL query processing application written using BSPIib [4]. Unlike other parallel pro...
Jonathan M. D. Hill, Stephen A. Jarvis, Constantin...
DPD
2006
141views more  DPD 2006»
15 years 6 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
CIDR
2007
144views Algorithms» more  CIDR 2007»
15 years 7 months ago
Cache-Oblivious Query Processing
We propose a radical approach to relational query processing that aims at automatically and consistently achieving a good performance on any memory hierarchy. We believe this auto...
Bingsheng He, Qiong Luo
CIKM
2007
Springer
16 years 13 days ago
Predictive user click models based on click-through history
Web search engines consistently collect information about users interaction with the system: they record the query they issued, the URL of presented and selected documents along w...
Benjamin Piwowarski, Hugo Zaragoza
SIGMOD
2008
ACM
169views Database» more  SIGMOD 2008»
16 years 6 months ago
MCDB: a monte carlo approach to managing uncertain data
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
Ravi Jampani, Fei Xu, Mingxi Wu, Luis Leopoldo Per...