Minimal probing: supporting expensive predicates for top-k queries
- Title
- Minimal probing: supporting expensive predicates for top-k queries
- Authors
- 황승원
- Date Issued
- 2002-06-01
- Publisher
- ACM
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/74362
- Article Type
- Conference
- Citation
- SIGMOD International Conference on Management of Data, page. 246 - 357, 2002-06-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.