We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity ...
Many new database applications require very large volumes of data. Mariposa is a data base system under construction at Berkeley responding to this need. Mariposa objects can be s...
Michael Stonebraker, Robert Devine, Marcel Kornack...
This paper describes our ongoing work developing the Stanford Stream Data Manager (STREAM), a system for executing continuous queries over multiple continuous data streams. The ST...
Rajeev Motwani, Jennifer Widom, Arvind Arasu, Bria...
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
We present HyperFlow, a novel visual language for information analysis that combines features from visual dataflow and visual query languages into a unified framework. HyperFlow i...