A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union
- A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union
- 유환조; 한욱신; 문양세; 황승원; 이진수
- POSTECH Authors
- Date Issued
- Article Type
- ACM Conference on Management of Databases (SIGMOD), 2011-06-14
- 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.