Sciweavers

3101 search results - page 443 / 621
» Using Relational Databases in the Engineering Repository Sys...
Sort
View
WWW
2009
ACM
16 years 7 months ago
An axiomatic approach for result diversification
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
Sreenivas Gollapudi, Aneesh Sharma
SIGMOD
2005
ACM
220views Database» more  SIGMOD 2005»
16 years 6 months ago
Sampling Algorithms in a Stream Operator
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...
Theodore Johnson, S. Muthukrishnan, Irina Rozenbau...
171
Voted
ICDE
1987
IEEE
81views Database» more  ICDE 1987»
15 years 9 months ago
Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
Hans-Peter Kriegel, Bernhard Seeger
150
Voted
KDD
1998
ACM
140views Data Mining» more  KDD 1998»
15 years 10 months ago
Blurring the Distinction between Command and Data in Scientific KDD
We have been working on two different KDD systems for scientific data. One system involves comparative genomics, where the database contains more than 60,000 plant gene and protei...
John V. Carlis, Elizabeth Shoop, Scott Krieger
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
15 years 11 months ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang