메뉴 건너뛰기




Volumn , Issue , 2007, Pages 906-915

Personalizing XML search in PIMENTO

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; QUERY PROCESSING; SEARCH ENGINES; USER INTERFACES;

EID: 34548785520     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367936     Document Type: Conference Paper
Times cited : (11)

References (21)
  • 1
    • 0040438358 scopus 로고    scopus 로고
    • R. Agrawal and et, al, A framework for Expressing and Combining Preferences. In SIGMOD, 2000.
    • R. Agrawal and et, al, A framework for Expressing and Combining Preferences. In SIGMOD, 2000.
  • 2
    • 0039561477 scopus 로고    scopus 로고
    • Minimization of Tree Pattern Queries
    • S. Amer-Yahia and et. al. Minimization of Tree Pattern Queries. In SIGMOD, 2001.
    • (2001) SIGMOD
    • Amer-Yahia, S.1    and et., al.2
  • 3
    • 3142770652 scopus 로고    scopus 로고
    • FleXPath: Flexible Structure and Full-Text Querying, for XML
    • S. Amer-Yahia and et. al. FleXPath: Flexible Structure and Full-Text Querying, for XML. In SIGMOD, 2004.
    • (2004) SIGMOD
    • Amer-Yahia, S.1    and et., al.2
  • 4
    • 34548807180 scopus 로고    scopus 로고
    • On Real-time Top-k Querying for Mobile Devices
    • W.-T. Balke and et. al. On Real-time Top-k Querying for Mobile Devices. In CoOpIS, 2002.
    • (2002) CoOpIS
    • Balke, W.-T.1    and et., al.2
  • 5
    • 0035008034 scopus 로고    scopus 로고
    • S. Borzsonyi and et. al. The Skyline Operator. In ICDE, 2001.
    • S. Borzsonyi and et. al. The Skyline Operator. In ICDE, 2001.
  • 6
    • 34548777719 scopus 로고    scopus 로고
    • Expressiveness and Performance of Full-Text Search Languages
    • C. Botev and et. al. Expressiveness and Performance of Full-Text Search Languages. In EDBT, 2006.
    • (2006) EDBT
    • Botev, C.1    and et., al.2
  • 7
    • 0036211203 scopus 로고    scopus 로고
    • Evaluating Top-k Queries Over Web-Accessible Databases
    • N. Bruno and et. al. Evaluating Top-k Queries Over Web-Accessible Databases. In ICDE, 2002.
    • (2002) ICDE
    • Bruno, N.1    and et., al.2
  • 8
    • 34548760997 scopus 로고    scopus 로고
    • Evaluating Top-k Selection Queries
    • S. Chaudhuriand et. al. Evaluating Top-k Selection Queries. In VLDB, 1999.
    • (1999) VLDB
    • Chaudhuriand, S.1    et., al.2
  • 9
    • 3142632034 scopus 로고    scopus 로고
    • Preference formulas in relational queries
    • J. Chomicki. Preference formulas in relational queries; ACM TODS, 28(4):427-466, 2003.
    • (2003) ACM TODS , vol.28 , Issue.4 , pp. 427-466
    • Chomicki, J.1
  • 10
    • 34548731492 scopus 로고    scopus 로고
    • R. Fagin and et. al. Optimal Aggregation Algorithms for Middleware. In POAS', 2001.
    • R. Fagin and et. al. Optimal Aggregation Algorithms for Middleware. In POAS', 2001.
  • 11
    • 34548786316 scopus 로고    scopus 로고
    • Initiative for the Evaluation of XML Retrieval. http://inex.is. informatik.uni-duisburg.de:2004/.
    • Initiative for the Evaluation of XML Retrieval. http://inex.is. informatik.uni-duisburg.de:2004/.
  • 12
    • 4043126187 scopus 로고    scopus 로고
    • Foundations of Preferences in,Database Systems
    • W. Kiešling. Foundations of Preferences in,Database Systems, In VLDB, 2002.
    • (2002) VLDB
    • Kiešling, W.1
  • 14
    • 33749066849 scopus 로고    scopus 로고
    • Rule-based query personalization in digital libraries
    • G. Koutrika and et. al. Rule-based query personalization in digital libraries. IJDL, 4(l):60-63, 2004.
    • (2004) IJDL, 4(l) , pp. 60-63
    • Koutrika, G.1    and et., al.2
  • 15
    • 34548808761 scopus 로고    scopus 로고
    • G. Koutrika and et. al. Personalized Queries under a Gener-alized Preference Model. InICDE, 2005.
    • G. Koutrika and et. al. Personalized Queries under a Gener-alized Preference Model. InICDE, 2005.
  • 16
    • 29844457931 scopus 로고    scopus 로고
    • C. Li and et, al. RankSQL: query algebra and optimization for relational top-k queries. In SIGMOD, 2005.
    • C. Li and et, al. RankSQL: query algebra and optimization for relational top-k queries. In SIGMOD, 2005.
  • 17
    • 34548770799 scopus 로고    scopus 로고
    • Adaptive Processing of Top-k Queries in XML
    • A. Marian and et. al. Adaptive Processing of Top-k Queries in XML. In VLDB, 2005.
    • (2005) VLDB
    • Marian, A.1    and et., al.2
  • 18
    • 0036038432 scopus 로고    scopus 로고
    • Containment and Equivalence for an XPath Fragment
    • G. Miklau and D. Suciu. Containment and Equivalence for an XPath Fragment. In PODS, .2002.
    • (2002) PODS
    • Miklau, G.1    Suciu, D.2
  • 19
    • 34548760405 scopus 로고    scopus 로고
    • T. Schlied.er, Schema-Driven Evaluation of Approximate Tree-Pattern Queries. In EDBT, 2002.
    • T. Schlied.er, Schema-Driven Evaluation of Approximate Tree-Pattern Queries. In EDBT, 2002.
  • 21
    • 34548733273 scopus 로고    scopus 로고
    • 0 and XPath 2.0 Full-Text
    • 1, W3C Working Draft
    • XQuery 1.0 and XPath 2.0 Full-Text. http://www.w3.org/TR/2006/WD-xquery- full-text20060501/, 2006. W3C Working Draft.
    • (2006)
    • XQuery1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.