Sciweavers

6846 search results - page 1242 / 1370
» Querying a summary of database
Sort
View
173
Voted
PODS
2010
ACM
215views Database» more  PODS 2010»
16 years 20 hour ago
An optimal algorithm for the distinct elements problem
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
Daniel M. Kane, Jelani Nelson, David P. Woodruff
VLDB
1999
ACM
162views Database» more  VLDB 1999»
15 years 11 months ago
Active Views for Electronic Commerce
Electronic commerce is emerging as a major Websupported application. In this paper we argue that database technology can, and should, provide the backbone for a wide range of such...
Serge Abiteboul, Bernd Amann, Sophie Cluet, Anat E...
198
Voted
VLDB
1999
ACM
151views Database» more  VLDB 1999»
15 years 11 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross
228
Voted
CF
2007
ACM
15 years 11 months ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
188
Voted
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 11 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
« Prev « First page 1242 / 1370 Last » Next »