Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
21
search results - page 5 / 5
»
A Formal Reduction for Lock-Free Parallel Algorithms
Sort
relevance
views
votes
recent
update
View
thumb
title
32
click to vote
SIGMOD
2002
ACM
112
views
Database
»
more
SIGMOD 2002
»
Minimal probing: supporting expensive predicates for top-k queries
14 years 8 months ago
Download
eagle.cs.uiuc.edu
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
claim paper
Read More »
« Prev
« First
page 5 / 5
Last »
Next »