Sciweavers

17329 search results - page 3008 / 3466
» Improved non-approximability results
Sort
View
VLDB
2007
ACM
118views Database» more  VLDB 2007»
16 years 7 months ago
Materialized Views in Probabilistic Databases for Information Exchange and Query Optimization
Views over probabilistic data contain correlations between tuples, and the current approach is to capture these correlations using explicit lineage. In this paper we propose an al...
Christopher Re, Dan Suciu
208
Voted
PODS
2008
ACM
178views Database» more  PODS 2008»
16 years 7 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
16 years 6 months ago
Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
Panagiotis G. Ipeirotis, Vagelis Hristidis, Yuheng...
183
Voted
MOBISYS
2003
ACM
16 years 6 months ago
Characterizing Mobility and Network Usage in a Corporate Wireless Local-Area Network
Wireless local-area networks are becoming increasingly popular. They are commonplace on university campuses and inside corporations, and they have started to appear in public area...
Magdalena Balazinska, Paul Castro
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
16 years 4 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
« Prev « First page 3008 / 3466 Last » Next »