메뉴 건너뛰기




Volumn 208, Issue 5, 2010, Pages 521-544

Numerical constraints on XML data

Author keywords

Axiomatisation; Complexity; Implication; Integrity; Numerical constraint; Shortest path; XML

Indexed keywords

AXIOMATISATION; CARDINALITY CONSTRAINTS; COMPLEXITY; DATA MODELLING; DATA VALUES; DECISION PROBLEMS; GENERALISATION; IMPLICATION PROBLEM; INDEX SELECTION; QUADRATIC TIME; SHORTEST PATH; SHORTEST PATH METHOD; THEORY AND PRACTICE; UPPER BOUND; XML DATA; XML ENCRYPTION; XML KEY; XPATH QUERIES;

EID: 77249108247     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.09.004     Document Type: Article
Times cited : (35)

References (46)
  • 4
    • 84949812618 scopus 로고    scopus 로고
    • M. Arenas, W. Fan, L. Libkin, What's hard about XML schema constraints? in: DEXA, Lecture Notes in Computer Science, 2453, Springer, Berlin, 2002, pp. 269-278.
    • M. Arenas, W. Fan, L. Libkin, What's hard about XML schema constraints? in: DEXA, Lecture Notes in Computer Science, vol. 2453, Springer, Berlin, 2002, pp. 269-278.
  • 5
    • 3042647135 scopus 로고    scopus 로고
    • A normal form for XML documents
    • Arenas M., and Libkin L. A normal form for XML documents. ACM Trans. Database Syst. 29 1 (2004) 195-232
    • (2004) ACM Trans. Database Syst. , vol.29 , Issue.1 , pp. 195-232
    • Arenas, M.1    Libkin, L.2
  • 6
    • 18144403233 scopus 로고    scopus 로고
    • Structural properties of XPath fragments
    • Benedikt M., Fan W., and Kuper G. Structural properties of XPath fragments. Theor. Comput. Sci. 336 1 (2005) 3-31
    • (2005) Theor. Comput. Sci. , vol.336 , Issue.1 , pp. 3-31
    • Benedikt, M.1    Fan, W.2    Kuper, G.3
  • 11
    • 0040748335 scopus 로고    scopus 로고
    • Constraints for semi-structured data and XML
    • Buneman P., Fan W., Siméon J., and Weinstein S. Constraints for semi-structured data and XML. SIGMOD Record 30 1 (2001) 47-54
    • (2001) SIGMOD Record , vol.30 , Issue.1 , pp. 47-54
    • Buneman, P.1    Fan, W.2    Siméon, J.3    Weinstein, S.4
  • 13
    • 84878734696 scopus 로고    scopus 로고
    • J. Chomicki, Consistent query answering: five easy pieces, in: ICDT (2007), Lecture Notes in Computer Science, 4353, Springer, Berlin, pp. 1-17.
    • J. Chomicki, Consistent query answering: five easy pieces, in: ICDT (2007), Lecture Notes in Computer Science, vol. 4353, Springer, Berlin, pp. 1-17.
  • 14
    • 77249110054 scopus 로고    scopus 로고
    • J. Clark, S. DeRose, XML path language (XPath) version 1.0, W3C recommendation, November 1999. Available from
    • J. Clark, S. DeRose, XML path language (XPath) version 1.0, W3C recommendation, November 1999. Available from: .
  • 16
  • 17
    • 0037944958 scopus 로고    scopus 로고
    • On XML integrity constraints in the presence of DTDs
    • Fan W., and Libkin L. On XML integrity constraints in the presence of DTDs. J. ACM 49 3 (2002) 368-406
    • (2002) J. ACM , vol.49 , Issue.3 , pp. 368-406
    • Fan, W.1    Libkin, L.2
  • 18
    • 0038266949 scopus 로고    scopus 로고
    • Integrity constraints for XML
    • Fan W., and Siméon J. Integrity constraints for XML. J. Comput. Syst. Sci. 66 1 (2003) 254-291
    • (2003) J. Comput. Syst. Sci. , vol.66 , Issue.1 , pp. 254-291
    • Fan, W.1    Siméon, J.2
  • 19
    • 23944498592 scopus 로고    scopus 로고
    • Efficient algorithms for processing XPath queries
    • Gottlob G., Koch C., and Pichler R. Efficient algorithms for processing XPath queries. ACM Trans. Database Syst. 30 2 (2005) 444-491
    • (2005) ACM Trans. Database Syst. , vol.30 , Issue.2 , pp. 444-491
    • Gottlob, G.1    Koch, C.2    Pichler, R.3
  • 20
    • 0022287890 scopus 로고
    • Inferences for numerical dependencies
    • Grant J., and Minker J. Inferences for numerical dependencies. Theor. Comput. Sci. 41 (1985) 271-287
    • (1985) Theor. Comput. Sci. , vol.41 , pp. 271-287
    • Grant, J.1    Minker, J.2
  • 21
    • 32244441539 scopus 로고    scopus 로고
    • A selective key-oriented XML index for the index selection problem in XDBMS, in DEXA
    • Springer, Berlin
    • B. Hammerschmidt, M. Kempa, V. Linnemann, A selective key-oriented XML index for the index selection problem in XDBMS, in DEXA, Lecture Notes in Computer Science, vol. 3180, Springer, Berlin, 2004, pp. 273-284.
    • (2004) Lecture Notes in Computer Science , vol.3180 , pp. 273-284
    • Hammerschmidt, B.1    Kempa, M.2    Linnemann, V.3
  • 22
    • 0035565195 scopus 로고    scopus 로고
    • On the implication problem for cardinality constraints and functional dependencies
    • Hartmann S. On the implication problem for cardinality constraints and functional dependencies. Ann. Math. Art. Intell. 33 (2001) 253-307
    • (2001) Ann. Math. Art. Intell. , vol.33 , pp. 253-307
    • Hartmann, S.1
  • 23
    • 35248816466 scopus 로고    scopus 로고
    • Soft constraints and heuristic constraint correction in Entity-Relationship modelling
    • Semantics in Databases, Springer, Berlin
    • S. Hartmann, Soft constraints and heuristic constraint correction in Entity-Relationship modelling, in: Semantics in Databases, Lecture Notes in Computer Science, vol. 2582, Springer, Berlin, 2001, pp. 82-99.
    • (2001) Lecture Notes in Computer Science , vol.2582 , pp. 82-99
    • Hartmann, S.1
  • 25
    • 57349175484 scopus 로고    scopus 로고
    • S. Hartmann, H. Koehler, S. Link, T. Trinh, J. Wang, On the notion of an XML key, in: SDKB, Lecture Notes in Computer Science, 4925, Springer, Berlin, 2008, pp. 103-112.
    • S. Hartmann, H. Koehler, S. Link, T. Trinh, J. Wang, On the notion of an XML key, in: SDKB, Lecture Notes in Computer Science, vol. 4925, Springer, Berlin, 2008, pp. 103-112.
  • 26
    • 35248860121 scopus 로고    scopus 로고
    • S. Hartmann, S. Link, More functional dependencies for XML, in: AdBIS, Lecture Notes in Computer Science, 2798, Springer, Berlin, 2003, pp. 355-369.
    • S. Hartmann, S. Link, More functional dependencies for XML, in: AdBIS, Lecture Notes in Computer Science, vol. 2798, Springer, Berlin, 2003, pp. 355-369.
  • 27
    • 39549085359 scopus 로고    scopus 로고
    • Characterising nested database dependencies by fragments of propositional logic
    • Hartmann S., and Link S. Characterising nested database dependencies by fragments of propositional logic. Ann. Pure Appl. Logic 152 1-3 (2008) 84-106
    • (2008) Ann. Pure Appl. Logic , vol.152 , Issue.1-3 , pp. 84-106
    • Hartmann, S.1    Link, S.2
  • 28
    • 67651242794 scopus 로고    scopus 로고
    • Efficient reasoning about a robust XML key fragment
    • (article 10)
    • Hartmann S., and Link S. Efficient reasoning about a robust XML key fragment. ACM Trans. Database Syst. 34 2 (2009) (article 10)
    • (2009) ACM Trans. Database Syst. , vol.34 , Issue.2
    • Hartmann, S.1    Link, S.2
  • 29
    • 70349135779 scopus 로고    scopus 로고
    • Expressive, yet tractable XML keys
    • EDBT, ACM International, ACM
    • S. Hartmann, S. Link, Expressive, yet tractable XML keys, in: EDBT, ACM International Conference Proceeding Series, vol. 360, ACM, 2009, pp. 357-367.
    • (2009) Conference Proceeding Series , vol.360 , pp. 357-367
    • Hartmann, S.1    Link, S.2
  • 30
    • 33745660113 scopus 로고    scopus 로고
    • S. Hartmann, T. Trinh, Axiomatising functional dependencies for XML with frequencies, in: FoIKS, Lecture Notes in Computer Science, 3861, Springer, Berlin, 2006, pp. 159-178.
    • S. Hartmann, T. Trinh, Axiomatising functional dependencies for XML with frequencies, in: FoIKS, Lecture Notes in Computer Science, vol. 3861, Springer, Berlin, 2006, pp. 159-178.
  • 33
    • 0025632431 scopus 로고
    • On the satisfiability of dependency constraints in entity-relationship schemata
    • Lenzerini M., and Nobili P. On the satisfiability of dependency constraints in entity-relationship schemata. Inform. Syst. 15 4 (1990) 453-461
    • (1990) Inform. Syst. , vol.15 , Issue.4 , pp. 453-461
    • Lenzerini, M.1    Nobili, P.2
  • 34
    • 0027867461 scopus 로고
    • Cardinality constraints in semantic data models
    • Liddle S., Embley D., and Woodfield S. Cardinality constraints in semantic data models. Data Knowl. Eng. 11 (1993) 235-270
    • (1993) Data Knowl. Eng. , vol.11 , pp. 235-270
    • Liddle, S.1    Embley, D.2    Woodfield, S.3
  • 35
    • 4243187063 scopus 로고    scopus 로고
    • Containment and equivalence for a fragment of XPath
    • Miklau G., and Suciu D. Containment and equivalence for a fragment of XPath. J. ACM 51 1 (2004) 2-45
    • (2004) J. ACM , vol.51 , Issue.1 , pp. 2-45
    • Miklau, G.1    Suciu, D.2
  • 36
    • 84948579632 scopus 로고    scopus 로고
    • On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
    • Neven F., and Schwentick T. On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Logic. Methods Comput. Sci. 2 3:1 (2006)
    • (2006) Logic. Methods Comput. Sci. , vol.2 , Issue.3 1
    • Neven, F.1    Schwentick, T.2
  • 37
    • 84915269983 scopus 로고
    • The optimal selection of secondary indices is NP-complete
    • Piatetsky-Shapiro G. The optimal selection of secondary indices is NP-complete. SIGMOD Record 13 2 (1983) 72-75
    • (1983) SIGMOD Record , vol.13 , Issue.2 , pp. 72-75
    • Piatetsky-Shapiro, G.1
  • 38
    • 0019590420 scopus 로고
    • An equivalence between relational database dependencies and a fragment of propositional logic
    • Sagiv Y., Delobel C., Stott Parker Jr. D., and Fagin R. An equivalence between relational database dependencies and a fragment of propositional logic. J. ACM 28 3 (1981) 435-453
    • (1981) J. ACM , vol.28 , Issue.3 , pp. 435-453
    • Sagiv, Y.1    Delobel, C.2    Stott Parker Jr., D.3    Fagin, R.4
  • 39
    • 0040030069 scopus 로고    scopus 로고
    • On database theory and XML
    • Suciu D. On database theory and XML. SIGMOD Record 30 3 (2001) 39-45
    • (2001) SIGMOD Record , vol.30 , Issue.3 , pp. 39-45
    • Suciu, D.1
  • 41
    • 77249148091 scopus 로고    scopus 로고
    • H. Thompson, D. Beech, M. Maloney, N. Mendelsohn, XML Schema. Part 1: structures W3C recommendation, second ed., October 2004. Available from: .
    • H. Thompson, D. Beech, M. Maloney, N. Mendelsohn, XML Schema. Part 1: structures W3C recommendation, second ed., October 2004. Available from: .
  • 42
    • 14344255215 scopus 로고    scopus 로고
    • A web odyssey: from Codd to XML
    • Vianu V. A web odyssey: from Codd to XML. SIGMOD Record 32 2 (2003) 68-77
    • (2003) SIGMOD Record , vol.32 , Issue.2 , pp. 68-77
    • Vianu, V.1
  • 43
    • 7544221362 scopus 로고    scopus 로고
    • Strong functional dependencies and their application to normal forms in XML
    • Vincent M., Liu J., and Liu C. Strong functional dependencies and their application to normal forms in XML. ACM Trans. Database Syst. 29 3 (2004) 445-462
    • (2004) ACM Trans. Database Syst. , vol.29 , Issue.3 , pp. 445-462
    • Vincent, M.1    Liu, J.2    Liu, C.3
  • 45
    • 0001887843 scopus 로고    scopus 로고
    • Data management for XML: research directions
    • Widom J. Data management for XML: research directions. Data Eng. Bull. 22 3 (1999) 44-52
    • (1999) Data Eng. Bull. , vol.22 , Issue.3 , pp. 44-52
    • Widom, J.1
  • 46
    • 35248865226 scopus 로고    scopus 로고
    • P. Wood, Containment for XPath fragments under DTD constraints, in: ICDT, 2003, Lecture Notes in Computer Science, 2572, pp. 297-311.
    • P. Wood, Containment for XPath fragments under DTD constraints, in: ICDT, 2003, Lecture Notes in Computer Science, vol. 2572, pp. 297-311.


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