Sciweavers

152 search results - page 24 / 31
» Efficient computation of personal aggregate queries on blogs
Sort
View
SIGMOD
2010
ACM
132views Database» more  SIGMOD 2010»
13 years 3 months ago
Durable top-k search in document archives
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
Leong Hou U, Nikos Mamoulis, Klaus Berberich, Srik...
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
14 years 8 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
EWSN
2009
Springer
14 years 9 months ago
Multi-hop Cluster Hierarchy Maintenance in Wireless Sensor Networks: A Case for Gossip-Based Protocols
Multi-hop cluster hierarchy has been presented as an organization for large wireless sensor networks (WSNs) that can provide scalable routing, data aggregation, and querying. In th...
Konrad Iwanicki, Maarten van Steen
HPDC
2010
IEEE
13 years 9 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim
IDEAS
2006
IEEE
104views Database» more  IDEAS 2006»
14 years 2 months ago
Exploiting Indifference for Customization of Partial Order Skylines
Unlike numerical preferences, preferences on attribute values do not show an inherent total order, but skyline computation has to rely on partial orderings explicitly stated by th...
Wolf-Tilo Balke, Ulrich Güntzer, Wolf Sibersk...