Sciweavers

1007 search results - page 92 / 202
» Worst-Case Optimal Algorithms for Parallel Query Processing
Sort
View
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
16 years 3 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
174
Voted
PPOPP
2003
ACM
15 years 8 months ago
Optimizing data aggregation for cluster-based internet services
Large-scale cluster-based Internet services often host partitioned datasets to provide incremental scalability. The aggregation of results produced from multiple partitions is a f...
Lingkun Chu, Hong Tang, Tao Yang, Kai Shen
ICPR
2004
IEEE
16 years 4 months ago
Relaxation Labeling Processes for Protein Secondary Structure Prediction
The prediction of protein secondary structure is a classical problem in bioinformatics, and in the past few years several machine learning techniques have been proposed to t. From...
Giacomo Colle, Marcello Pelillo
TPDS
2010
256views more  TPDS 2010»
15 years 1 months ago
Privacy-Conscious Location-Based Queries in Mobile Environments
— In location-based services, users with location-aware mobile devices are able to make queries about their surroundings anywhere and at any time. While this ubiquitous computing...
Jianliang Xu, Xueyan Tang, Haibo Hu, Jing Du
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
14 years 5 months ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite