45 search results - page 8 / 9 » On the Memory Requirements of XPath Evaluation over XML Stre... |
SIGMOD
2006
ACM
14 years 5 months ago
2006
ACM
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
IDA
2002
Springer
13 years 5 months ago
2002
Springer
Most classification methods are based on the assumption that the data conforms to a stationary distribution. However, the real-world data is usually collected over certain periods...
ICDE
2007
IEEE
14 years 6 months ago
2007
IEEE
We address the problem of preserving privacy in streams, which has received surprisingly limited attention. For static data, a well-studied and widely used approach is based on ra...
ICDM
2005
IEEE
13 years 11 months ago
2005
IEEE
Frequent itemset mining is a core data mining operation and has been extensively studied over the last decade. This paper takes a new approach for this problem and makes two major...
DASFAA
2010
IEEE
13 years 3 months ago
2010
IEEE
Sampling streams of continuous data with limited memory, or reservoir sampling, is a utility algorithm. Standard reservoir sampling maintains a random sample of the entire stream a...