Publications

Detailed Information

Top-K 키워드 질의를 위한 효율적 집계 조인 방법 : Pipelined aggregate join for Top-K keyword queries

DC Field Value Language
dc.contributor.advisor이상구-
dc.contributor.author이태희-
dc.date.accessioned2010-02-02T08:28:32Z-
dc.date.available2010-02-02T08:28:32Z-
dc.date.copyright2006.-
dc.date.issued2006-
dc.identifier.urihttp://dcollection.snu.ac.kr:80/jsp/common/DcLoOrgPer.jsp?sItemId=000000048767kog
dc.identifier.urihttps://hdl.handle.net/10371/48545-
dc.description학위논문(박사)--서울대학교 대학원 :전기. 컴퓨터공학부,2006.ko
dc.format.extentv, 110 p.ko
dc.language.isokoko
dc.publisher서울대학교 대학원ko
dc.subject키워드 검색ko
dc.subjectKeyword Searchko
dc.subjectTop-K 검색ko
dc.subjectTop-K Retrievalko
dc.subjectTop-K 조인ko
dc.subjectTop-K Joinko
dc.subject집계 조인ko
dc.subjectAggregate Joinko
dc.subject질의 처리ko
dc.subjectQuery Processingko
dc.subjectBayesian Belief Networkko
dc.subjectBayesian Belief Networkko
dc.subject온톨로지ko
dc.subjectOntologyko
dc.titleTop-K 키워드 질의를 위한 효율적 집계 조인 방법ko
dc.title.alternativePipelined aggregate join for Top-K keyword queriesko
dc.typeThesis-
dc.contributor.department전기. 컴퓨터공학부-
dc.description.degreeDoctorko
Appears in Collections:
Files in This Item:
There are no files associated with this item.

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share