Sciweavers

1418 search results - page 155 / 284
» A Theory of Stream Queries
Sort
View
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
14 years 1 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
ICDE
2011
IEEE
222views Database» more  ICDE 2011»
13 years 29 days ago
Dynamic prioritization of database queries
— Enterprise database systems handle a variety of diverse query workloads that are of different importance to the business. For example, periodic reporting queries are usually mi...
Sivaramakrishnan Narayanan, Florian Waas
PODS
2008
ACM
221views Database» more  PODS 2008»
14 years 9 months ago
A generic flow algorithm for shared filter ordering problems
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...
ICDE
2012
IEEE
227views Database» more  ICDE 2012»
11 years 11 months ago
Temporal Analytics on Big Data for Web Advertising
—“Big Data” in map-reduce (M-R) clusters is often fundamentally temporal in nature, as are many analytics tasks over such data. For instance, display advertising uses Behavio...
Badrish Chandramouli, Jonathan Goldstein, Songyun ...
PODS
2010
ACM
207views Database» more  PODS 2010»
14 years 2 months ago
Understanding cardinality estimation using entropy maximization
Cardinality estimation is the problem of estimating the number of tuples returned by a query; it is a fundamentally important task in data management, used in query optimization, ...
Christopher Ré, Dan Suciu