Sciweavers

2635 search results - page 148 / 527
» Algorithms for the Database Layout Problem
Sort
View
EDBT
2008
ACM
135views Database» more  EDBT 2008»
16 years 4 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo
ICDE
1998
IEEE
103views Database» more  ICDE 1998»
16 years 5 months ago
Online Generation of Association Rules
We have a large database consisting of sales transactions. We investigate the problem of online mining of association rules in this large database. We show how to preprocess the d...
Charu C. Aggarwal, Philip S. Yu
GIS
2004
ACM
16 years 5 months ago
Algorithms for the placement of diagrams on maps
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...
Étienne Schramm, Alexander Wolff, Marc J. v...
SIGMOD
2008
ACM
102views Database» more  SIGMOD 2008»
16 years 4 months ago
Stream firewalling of xml constraints
As XML-based messages have become common in many client-server protocols, there is a need to protect application servers from invalid or dangerous messages. This leads to the XML ...
Michael Benedikt, Alan Jeffrey, Ruy Ley-Wild
PODS
2003
ACM
151views Database» more  PODS 2003»
16 years 4 months ago
Feasible itemset distributions in data mining: theory and application
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
Ganesh Ramesh, William Maniatty, Mohammed Javeed Z...