메뉴 건너뛰기




Volumn 22, Issue 7, 2007, Pages 723-737

Flexible querying of semistructured data: A fuzzy-set-based approach

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FUZZY SETS; PARAMETER ESTIMATION; VECTORS;

EID: 34547188626     PISSN: 08848173     EISSN: 1098111X     Source Type: Journal    
DOI: 10.1002/int.20225     Document Type: Article
Times cited : (4)

References (33)
  • 2
    • 0003898407 scopus 로고    scopus 로고
    • Andreasen T, Christiansen H, Larsen HL, editors, Dordrect: Kluwer Academic Publishers;
    • Andreasen T, Christiansen H, Larsen HL, editors. Flexible query answering systems. Dordrect: Kluwer Academic Publishers; 1997.
    • (1997) Flexible query answering systems
  • 4
    • 34547162741 scopus 로고    scopus 로고
    • Labio W, Garcia-Molina H. Efficient algorithms to compare snapshots. Manuscript, available by anonymous ftp from db.stanford.edu in pub/labio/1995/; 1995.
    • Labio W, Garcia-Molina H. Efficient algorithms to compare snapshots. Manuscript, available by anonymous ftp from db.stanford.edu in pub/labio/1995/; 1995.
  • 7
    • 0344927764 scopus 로고    scopus 로고
    • XDiff: An effective change detection algorithm for XML documents
    • Bangalore, India, March
    • Wang Y, DeWitt D, Cai JY. XDiff: An effective change detection algorithm for XML documents. In: Proc Int Conf on Data Engineering, Bangalore, India, March 2003. pp 519-530.
    • (2003) Proc Int Conf on Data Engineering , pp. 519-530
    • Wang, Y.1    DeWitt, D.2    Cai, J.Y.3
  • 9
    • 0003108406 scopus 로고    scopus 로고
    • Using schema matching to simplify heterogeneous data translation
    • New York;
    • Milo T, Zohar S. Using schema matching to simplify heterogeneous data translation. In: Proc Very Large Data Bases (VLDB'98), New York; 1998. pp 122-133.
    • (1998) Proc Very Large Data Bases (VLDB'98) , pp. 122-133
    • Milo, T.1    Zohar, S.2
  • 11
    • 0024889169 scopus 로고
    • Simple fast algorithms for the editing distance between trees and related problems
    • Zhang K, Shasha D. Simple fast algorithms for the editing distance between trees and related problems. SIAM J Comput 1989;18:1245-1262.
    • (1989) SIAM J Comput , vol.18 , pp. 1245-1262
    • Zhang, K.1    Shasha, D.2
  • 12
    • 0003412359 scopus 로고
    • Tree matching problems with application to structured text databases
    • Technical Report, Department of Computer Science, University of Helsinki, Finland;
    • Kilpelaïnen P. Tree matching problems with application to structured text databases. Technical Report, Department of Computer Science, University of Helsinki, Finland; 1992.
    • (1992)
    • Kilpelaïnen, P.1
  • 14
    • 0033699332 scopus 로고    scopus 로고
    • Discovering structural association of semi-structured data
    • Wang K, Liu H. Discovering structural association of semi-structured data. IEEE Trans Knowl Data Eng 2000;12:353-371.
    • (2000) IEEE Trans Knowl Data Eng , vol.12 , pp. 353-371
    • Wang, K.1    Liu, H.2
  • 17
    • 24344486868 scopus 로고    scopus 로고
    • Efficiently mining frequent trees in a forest: Algorithms and applications
    • Zaki M. Efficiently mining frequent trees in a forest: Algorithms and applications. IEEE Trans Knowl Data Eng 2005;17:1021-1035.
    • (2005) IEEE Trans Knowl Data Eng , vol.17 , pp. 1021-1035
    • Zaki, M.1
  • 18
    • 34547232920 scopus 로고    scopus 로고
    • Données semi-structurées- Découverte, maintenance et analyse de tendances
    • Laur PA, Teisseire M, Poncelet P. Données semi-structurées- Découverte, maintenance et analyse de tendances. RSTI série ISI 2003;8:49-78.
    • (2003) RSTI série ISI , vol.8 , pp. 49-78
    • Laur, P.A.1    Teisseire, M.2    Poncelet, P.3
  • 20
    • 3543129367 scopus 로고    scopus 로고
    • Ph.D. Dissertation. University of California, Los Angeles;
    • Lee DW. Query relaxation for XML model. Ph.D. Dissertation. University of California, Los Angeles; 2002.
    • (2002) Query relaxation for XML model
    • Lee, D.W.1
  • 22
    • 0344927333 scopus 로고    scopus 로고
    • Amer-Yahia S, Koudas N, Srivastava D. Approximate matching in XML. ICDE'03 tutorial. Available at: http://www.research.att.com/~sihem/publications/ .
    • Amer-Yahia S, Koudas N, Srivastava D. Approximate matching in XML. ICDE'03 tutorial. Available at: http://www.research.att.com/~sihem/publications/ .
  • 23
    • 0035330219 scopus 로고    scopus 로고
    • The use of some fuzzy logic techniques in multimedia databases querying
    • Dubois D, Prade H, Sedes F. The use of some fuzzy logic techniques in multimedia databases querying. IEEE Trans Data Knowl Eng 2001;13:383-393.
    • (2001) IEEE Trans Data Knowl Eng , vol.13 , pp. 383-393
    • Dubois, D.1    Prade, H.2    Sedes, F.3
  • 24
    • 84947909117 scopus 로고
    • Blind queries to XML data
    • Ibrahim M, Küng J, Revell N, editors. Proc 11th Int Conf on Database and Expert Systems Applications, Berlin: Springer Verlag;
    • Damiani E, Tanca L. Blind queries to XML data. In: Ibrahim M, Küng J, Revell N, editors. Proc 11th Int Conf on Database and Expert Systems Applications. Lecture Notes in Computer Science 1873. Berlin: Springer Verlag; 2000. pp 345-356.
    • (1873) Lecture Notes in Computer Science , pp. 345-356
    • Damiani, E.1    Tanca, L.2
  • 25
    • 84883822233 scopus 로고    scopus 로고
    • Fuzzy techniques for XML Data Smushing
    • Berlin: Springer Verlag;
    • Damiani E, Oliboni B, Tanca L. Fuzzy techniques for XML Data Smushing, Lecture Notes in Computer Science 2206. Berlin: Springer Verlag; 2001. pp 637-689.
    • (2001) Lecture Notes in Computer Science , vol.2206 , pp. 637-689
    • Damiani, E.1    Oliboni, B.2    Tanca, L.3
  • 26
    • 0034354719 scopus 로고    scopus 로고
    • Fuzzy XML queries via context-based choice of aggregations
    • Damiani E, Tanca L, Arcelli Fontana F. Fuzzy XML queries via context-based choice of aggregations. Kybernetika 2000;36:635-655.
    • (2000) Kybernetika , vol.36 , pp. 635-655
    • Damiani, E.1    Tanca, L.2    Arcelli Fontana, F.3
  • 29
    • 23044531993 scopus 로고    scopus 로고
    • Adding flexibility to structure similarity queries on XML data
    • Andreasen T, Motro A, Christiansen H, Larsen HL, editors. Proc 5th Int Conf on Flexible Query Answering Systems FQAS, Berlin: Springer Verlag;
    • Ciaccia P, Pezzo W. Adding flexibility to structure similarity queries on XML data. In: Andreasen T, Motro A, Christiansen H, Larsen HL, editors. Proc 5th Int Conf on Flexible Query Answering Systems (FQAS 2002). Lecture Notes in Artificial Intelligence 2522. Berlin: Springer Verlag; 2002. pp 124-139.
    • (2002) Lecture Notes in Artificial Intelligence , vol.2522 , pp. 124-139
    • Ciaccia, P.1    Pezzo, W.2
  • 31
    • 0004664302 scopus 로고    scopus 로고
    • Find the items which certainly have (most of) important characteristics to a sufficient degree
    • Prague. Prague: Academia;
    • Dubois D, Nakata M, Prade H. Find the items which certainly have (most of) important characteristics to a sufficient degree. In: Proc 7th IFSA World Congress, Prague. Prague: Academia; 1997. pp 243-248.
    • (1997) Proc 7th IFSA World Congress , pp. 243-248
    • Dubois, D.1    Nakata, M.2    Prade, H.3


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