메뉴 건너뛰기




Volumn 3, Issue 1, 2010, Pages 429-438

On-the-fly entity-aware query processing in the presence of linkage

Author keywords

[No Author keywords available]

Indexed keywords

DATA INTEGRATION; EMBEDDED SYSTEMS; SEMANTICS;

EID: 79959927816     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920898     Document Type: Article
Times cited : (70)

References (33)
  • 2
    • 2342576574 scopus 로고    scopus 로고
    • Eliminating fuzzy duplicates in data warehouses
    • R. Ananthakrishna, S. Chaudhuri, and V. Ganti. Eliminating fuzzy duplicates in data warehouses. In VLDB, pages 586-597, 2002.
    • (2002) VLDB , pp. 586-597
    • Ananthakrishna, R.1    Chaudhuri, S.2    Ganti, V.3
  • 5
    • 84882718707 scopus 로고    scopus 로고
    • Inferring xml schema definitions from xml data
    • G. J. Bex, F. Neven, and S. Vansummeren. Inferring xml schema definitions from xml data. In VLDB, pages 998-1009, 2007.
    • (2007) VLDB , pp. 998-1009
    • Bex, G.J.1    Neven, F.2    Vansummeren, S.3
  • 7
    • 77954003729 scopus 로고    scopus 로고
    • Iterative record linkage for cleaning and integration
    • I. Bhattacharya and L. Getoor. Iterative record linkage for cleaning and integration. In DMKD, pages 11-18, 2004.
    • (2004) DMKD , pp. 11-18
    • Bhattacharya, I.1    Getoor, L.2
  • 8
    • 11144240583 scopus 로고    scopus 로고
    • A comparison of string distance metrics for name-matching tasks
    • W.W. Cohen, P. Ravikumar, and S. E. Fienberg. A comparison of string distance metrics for name-matching tasks. In IIWeb, pages 73-78, 2003.
    • (2003) IIWeb , pp. 73-78
    • Cohen, W.W.1    Ravikumar, P.2    Fienberg, S.E.3
  • 10
    • 36148994784 scopus 로고    scopus 로고
    • Efficient query evaluation on probabilistic databases
    • N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. VLDB, 16(4):523-544, 2007.
    • (2007) VLDB , vol.16 , Issue.4 , pp. 523-544
    • Dalvi, N.N.1    Suciu, D.2
  • 11
    • 35448996115 scopus 로고    scopus 로고
    • Management of probabilistic data: foundations and challenges
    • N. N. Dalvi and D. Suciu. Management of probabilistic data: foundations and challenges. In PODS, pages 1-12, 2007.
    • (2007) PODS , pp. 1-12
    • Dalvi, N.N.1    Suciu, D.2
  • 13
    • 17244380794 scopus 로고    scopus 로고
    • Semantic integration research in the database community: A brief survey
    • A. Doan and A. Y. Halevy. Semantic integration research in the database community: A brief survey. AI Magazine, 26(1):83-94, 2005.
    • (2005) AI Magazine , vol.26 , Issue.1 , pp. 83-94
    • Doan, A.1    Halevy, A.Y.2
  • 14
    • 29844452555 scopus 로고    scopus 로고
    • Reference reconciliation in complex information spaces
    • X. Dong, A. Halevy, and J. Madhavan. Reference reconciliation in complex information spaces. In SIGMOD, pages 85-96, 2005.
    • (2005) SIGMOD , pp. 85-96
    • Dong, X.1    Halevy, A.2    Madhavan, J.3
  • 15
    • 35448953024 scopus 로고    scopus 로고
    • Indexing dataspaces
    • X. Dong and A. Y. Halevy. Indexing dataspaces. In SIGMOD, pages 43-54, 2007.
    • (2007) SIGMOD , pp. 43-54
    • Dong, X.1    Halevy, A.Y.2
  • 16
    • 85011051649 scopus 로고    scopus 로고
    • Data integration with uncertainty
    • X. Dong, A. Y. Halevy, and C. Yu. Data integration with uncertainty. In VLDB, pages 687-698, 2007.
    • (2007) VLDB , pp. 687-698
    • Dong, X.1    Halevy, A.Y.2    Yu, C.3
  • 19
    • 0038006684 scopus 로고    scopus 로고
    • Tap: a semantic web platform
    • R. V. Guha and R. McCool. Tap: a semantic web platform. Computer Networks, 42(5):557-577, 2003.
    • (2003) Computer Networks , vol.42 , Issue.5 , pp. 557-577
    • Guha, R.V.1    McCool, R.2
  • 20
    • 34250660624 scopus 로고    scopus 로고
    • Principles of dataspace systems
    • A. Y. Halevy, M. J. Franklin, and D. Maier. Principles of dataspace systems. In PODS, pages 1-9, 2006.
    • (2006) PODS , pp. 1-9
    • Halevy, A.Y.1    Franklin, M.J.2    Maier, D.3
  • 22
    • 45849137843 scopus 로고    scopus 로고
    • Probabilistic entity linkage for heterogeneous information spaces
    • E. Ioannou, C. Niederée, and W. Nejdl. Probabilistic entity linkage for heterogeneous information spaces. In CAiSE, pages 556-570, 2008.
    • (2008) CAiSE , pp. 556-570
    • Ioannou, E.1    Niederée, C.2    Nejdl, W.3
  • 24
    • 33745266392 scopus 로고    scopus 로고
    • Domain-independent data cleaning via analysis of entity-relationship graph
    • D. V. Kalashnikov and S. Mehrotra. Domain-independent data cleaning via analysis of entity-relationship graph. ACM Trans. Database Syst., 31(2):716-767, 2006.
    • (2006) ACM Trans. Database Syst. , vol.31 , Issue.2 , pp. 716-767
    • Kalashnikov, D.V.1    Mehrotra, S.2
  • 25
    • 34250670467 scopus 로고    scopus 로고
    • Record linkage: similarity measures and algorithms
    • N. Koudas, S. Sarawagi, and D. Srivastava. Record linkage: similarity measures and algorithms. In SIGMOD Conference, pages 802-803, 2006.
    • (2006) SIGMOD Conference , pp. 802-803
    • Koudas, N.1    Sarawagi, S.2    Srivastava, D.3
  • 26
    • 85009048916 scopus 로고    scopus 로고
    • Semantic interoperability in global information systems: A brief introduction to the research area and the special section
    • A. M. Ouksel and A. P. Sheth. Semantic interoperability in global information systems: A brief introduction to the research area and the special section. SIGMOD Record, 28(1):5-12, 1999.
    • (1999) SIGMOD Record , vol.28 , Issue.1 , pp. 5-12
    • Ouksel, A.M.1    Sheth, A.P.2
  • 28
    • 70849135294 scopus 로고    scopus 로고
    • Managing probabilistic data with mystiq: The can-do, the could-do, and the can't-do
    • C. Re and D. Suciu. Managing probabilistic data with mystiq: The can-do, the could-do, and the can't-do. In SUM, pages 5-18, 2008.
    • (2008) SUM , pp. 5-18
    • Re, C.1    Suciu, D.2
  • 30
    • 0242456811 scopus 로고    scopus 로고
    • Interactive deduplication using active learning
    • S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In KDD, pages 269-278, 2002.
    • (2002) KDD , pp. 269-278
    • Sarawagi, S.1    Bhamidipaty, A.2
  • 31
    • 34548772330 scopus 로고    scopus 로고
    • Representing and querying correlated tuples in probabilistic databases
    • P. Sen and A. Deshpande. Representing and querying correlated tuples in probabilistic databases. In ICDE, pages 596-605, 2007.
    • (2007) ICDE , pp. 596-605
    • Sen, P.1    Deshpande, A.2


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