Sciweavers

505 search results - page 84 / 101
» Queries with Incomplete Answers over Semistructured Data
Sort
View
178
Voted
GPC
2007
Springer
15 years 10 months ago
Design of PeerSum: A Summary Service for P2P Applications
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
Rabab Hayek, Guillaume Raschia, Patrick Valduriez,...
HPDC
2010
IEEE
15 years 5 months ago
Distributing the power of OLAP
In this paper we present the Brown Dwarf, a distributed system designed to efficiently store, query and update multidimensional data over an unstructured Peer-to-Peer overlay, wit...
Katerina Doka, Dimitrios Tsoumakos, Nectarios Kozi...
DLOG
2010
15 years 1 months ago
On the feasibility of Description Logic knowledge bases with rough concepts and vague instances
Abstract. A usage scenario of bio-ontologies is hypothesis testing, such as finding relationships or new subconcepts in the data linked to the ontology. Whilst validating the hypot...
C. Maria Keet
217
Voted
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 4 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
141
Voted
CIKM
2007
Springer
15 years 10 months 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