20807 search results - page 3784 / 4162 » How to read a paper |
204
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
200
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
215
click to vote
SIGMOD
2002
ACM
16 years 7 months ago
2002
ACM
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
198
click to vote
SIGMOD
2002
ACM
16 years 7 months ago
2002
ACM
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
219
click to vote
SIGMOD
2001
ACM
16 years 7 months ago
2001
ACM
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...