Sciweavers

7129 search results - page 1218 / 1426
» Approximation Algorithms for Treewidth
Sort
View
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
16 years 3 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
16 years 3 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
16 years 3 months ago
Compressing Historical Information in Sensor Networks
We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order t...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
SIGMOD
2004
ACM
188views Database» more  SIGMOD 2004»
16 years 3 months ago
Online Event-driven Subsequence Matching over Financial Data Streams
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
Huanmei Wu, Betty Salzberg, Donghui Zhang
PODS
2001
ACM
135views Database» more  PODS 2001»
16 years 3 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
« Prev « First page 1218 / 1426 Last » Next »