X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    The problem of incomplete information in relational databases (1991)
    Berlin u.a. : Springer
    Details
    UID:
    b3kat_BV035771249
    Format: 1 Online-Ressource (VIII, 156 S.)
    ISBN: 3540549196 , 9783540549192
    Series Statement: Lecture notes in computer science 554
    Note: Zugl.: Helsinki, Univ., Diss., 1989
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Relationale Datenbank ; Unvollkommene Information ; Algorithmus ; Unvollkommene Information ; Relationales Datenbanksystem ; Unvollkommene Information ; Datenverwaltung ; Hochschulschrift ; Hochschulschrift
    DOI: 10.1007/3-540-54919-6
    URL: Volltext
    URL: Volltext
    URL: Cover
    URL: Inhaltstext
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: lizenzpflichtig
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    Stabi Berlin
    UB Potsdam
    EUV Frankfurt
    HTW Berlin
    TH Wildau
    BTU Cottbus
  • 2
    Book
    Book
    The problem of incomplete information in relational databases / (1991)
    Berlin u.a. :Springer,
    Details
    UID:
    almahu_BV004584283
    Format: VIII, 156 S.
    ISBN: 3-540-54919-6 , 0-387-54919-6
    Series Statement: Lecture notes in computer science 554
    Note: Zugl.: Helsinki, Univ., Diss., 1989
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Relationale Datenbank ; Unvollkommene Information ; Algorithmus ; Unvollkommene Information ; Relationales Datenbanksystem ; Unvollkommene Information ; Datenverwaltung ; Hochschulschrift ; Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    HU Berlin get availability status
    FU Berlin get availability status
  • 3
    Book
    Book
    The problem of incomplete information in relational databases (1991)
    Berlin u.a. : Springer
    Details
    UID:
    b3kat_BV004584283
    Format: VIII, 156 S.
    ISBN: 3540549196 , 0387549196
    Series Statement: Lecture notes in computer science 554
    Note: Zugl.: Helsinki, Univ., Diss., 1989
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Relationale Datenbank ; Unvollkommene Information ; Algorithmus ; Unvollkommene Information ; Relationales Datenbanksystem ; Unvollkommene Information ; Datenverwaltung ; Hochschulschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    TU Berlin get availability status
  • 4
    Online Resource
    Online Resource
    The Problem of Incomplete Information in Relational Databases (1991)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    edoccha_9959186363302883
    Format: 1 online resource (VIII, 164 p.)
    Edition: 1st ed. 1991.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-46507-3
    Series Statement: Lecture Notes in Computer Science, 554
    Content: In a relational database the information is recorded as rows in tables. However, in many practical situations the available information is incomplete and the values for some columns are missing. Yet few existing database management systems allow the user to enter null values in the database. This monograph analyses the problems raised by allowing null values in relational databases. The analysis covers semantical, syntactical, and computational aspects. Algorithms for query evaluation, dependency enforcement and updates in the presence of null values are also given. The analysis of the computational complexity of the algorithms suggests that from a practical point of view the database should be stored as Horn tables, which are generalizations of ordinary relations, allowing null values and Horn clause-like restrictions on these null values. Horn tables efficiently support a large class of queries, dependencies and updates.
    Note: Bibliographic Level Mode of Issuance: Monograph , Relational databases -- Semantic aspects of incomplete information -- Syntactic and algorithmic aspects of incomplete information -- Computational complexity aspects of incomplete information -- Some conclusive aspects. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-54919-6
    Language: English
    DOI: 10.1007/3-540-54919-6
    URL: http://dx.doi.org/10.1007/3-540-54919-6
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    Charité
  • 5
    Online Resource
    Online Resource
    The Problem of Incomplete Information in Relational Databases (1991)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    edocfu_9959186363302883
    Format: 1 online resource (VIII, 164 p.)
    Edition: 1st ed. 1991.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-46507-3
    Series Statement: Lecture Notes in Computer Science, 554
    Content: In a relational database the information is recorded as rows in tables. However, in many practical situations the available information is incomplete and the values for some columns are missing. Yet few existing database management systems allow the user to enter null values in the database. This monograph analyses the problems raised by allowing null values in relational databases. The analysis covers semantical, syntactical, and computational aspects. Algorithms for query evaluation, dependency enforcement and updates in the presence of null values are also given. The analysis of the computational complexity of the algorithms suggests that from a practical point of view the database should be stored as Horn tables, which are generalizations of ordinary relations, allowing null values and Horn clause-like restrictions on these null values. Horn tables efficiently support a large class of queries, dependencies and updates.
    Note: Bibliographic Level Mode of Issuance: Monograph , Relational databases -- Semantic aspects of incomplete information -- Syntactic and algorithmic aspects of incomplete information -- Computational complexity aspects of incomplete information -- Some conclusive aspects. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-54919-6
    Language: English
    DOI: 10.1007/3-540-54919-6
    URL: http://dx.doi.org/10.1007/3-540-54919-6
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    FU Berlin
  • 6
    Book
    Book
    The problem of incomplete information in relational databases (1991)
    Berlin : Springer
    Details
    UID:
    gbv_025388932
    Format: VIII, 156 S. , graph. Darst.
    ISBN: 3540549196 , 0387549196
    Series Statement: Lecture notes in computer science 554
    Note: Literaturverz. S. [143] - 149 , Zugl.: Helsinki, Univ., Diss., 1989
    Additional Edition: Online-Ausg. Grahne, Gösta The problem of incomplete information in relational databases Berlin [u.a.] : Springer, 1991 ISBN 9783540465072
    Additional Edition: Erscheint auch als Online-Ausgabe Grahne, Gösta The Problem of Incomplete Information in Relational Databases Berlin, Heidelberg : Springer Berlin Heidelberg, 1991 ISBN 9783540465072
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    RVK:
    ST 271
    Keywords: Relationales Datenbanksystem ; Unvollkommene Information ; Hochschulschrift
    URL: Cover
    URL: Inhaltstext
    URL: http://www.loc.gov/catdir/enhancements/fy0815/91035867-d.html
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Book
    Stabi Berlin get availability status
  • 7
    Online Resource
    Online Resource
    The Problem of Incomplete Information in Relational Databases (1991)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947920622602882
    Format: VIII, 164 p. , online resource.
    ISBN: 9783540465072
    Series Statement: Lecture Notes in Computer Science, 554
    Content: In a relational database the information is recorded as rows in tables. However, in many practical situations the available information is incomplete and the values for some columns are missing. Yet few existing database management systems allow the user to enter null values in the database. This monograph analyses the problems raised by allowing null values in relational databases. The analysis covers semantical, syntactical, and computational aspects. Algorithms for query evaluation, dependency enforcement and updates in the presence of null values are also given. The analysis of the computational complexity of the algorithms suggests that from a practical point of view the database should be stored as Horn tables, which are generalizations of ordinary relations, allowing null values and Horn clause-like restrictions on these null values. Horn tables efficiently support a large class of queries, dependencies and updates.
    Note: Relational databases -- Semantic aspects of incomplete information -- Syntactic and algorithmic aspects of incomplete information -- Computational complexity aspects of incomplete information -- Some conclusive aspects.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540549192
    Language: English
    DOI: 10.1007/3-540-54919-6
    URL: http://dx.doi.org/10.1007/3-540-54919-6
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 8
    Online Resource
    Online Resource
    The Problem of Incomplete Information in Relational Databases (1991)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almahu_9948621253302882
    Format: VIII, 164 p. , online resource.
    Edition: 1st ed. 1991.
    ISBN: 9783540465072
    Series Statement: Lecture Notes in Computer Science, 554
    Content: In a relational database the information is recorded as rows in tables. However, in many practical situations the available information is incomplete and the values for some columns are missing. Yet few existing database management systems allow the user to enter null values in the database. This monograph analyses the problems raised by allowing null values in relational databases. The analysis covers semantical, syntactical, and computational aspects. Algorithms for query evaluation, dependency enforcement and updates in the presence of null values are also given. The analysis of the computational complexity of the algorithms suggests that from a practical point of view the database should be stored as Horn tables, which are generalizations of ordinary relations, allowing null values and Horn clause-like restrictions on these null values. Horn tables efficiently support a large class of queries, dependencies and updates.
    Note: Relational databases -- Semantic aspects of incomplete information -- Syntactic and algorithmic aspects of incomplete information -- Computational complexity aspects of incomplete information -- Some conclusive aspects.
    In: Springer Nature eBook
    Additional Edition: Printed edition: ISBN 9783662207529
    Additional Edition: Printed edition: ISBN 9783540549192
    Language: English
    DOI: 10.1007/3-540-54919-6
    URL: https://doi.org/10.1007/3-540-54919-6
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 9
    Online Resource
    Online Resource
    The Problem of Incomplete Information in Relational Databases (1991)
    Berlin, Heidelberg :Springer Berlin Heidelberg :
    Details
    UID:
    almafu_9959186363302883
    Format: 1 online resource (VIII, 164 p.)
    Edition: 1st ed. 1991.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-46507-3
    Series Statement: Lecture Notes in Computer Science, 554
    Content: In a relational database the information is recorded as rows in tables. However, in many practical situations the available information is incomplete and the values for some columns are missing. Yet few existing database management systems allow the user to enter null values in the database. This monograph analyses the problems raised by allowing null values in relational databases. The analysis covers semantical, syntactical, and computational aspects. Algorithms for query evaluation, dependency enforcement and updates in the presence of null values are also given. The analysis of the computational complexity of the algorithms suggests that from a practical point of view the database should be stored as Horn tables, which are generalizations of ordinary relations, allowing null values and Horn clause-like restrictions on these null values. Horn tables efficiently support a large class of queries, dependencies and updates.
    Note: Bibliographic Level Mode of Issuance: Monograph , Relational databases -- Semantic aspects of incomplete information -- Syntactic and algorithmic aspects of incomplete information -- Computational complexity aspects of incomplete information -- Some conclusive aspects. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-54919-6
    Language: English
    DOI: 10.1007/3-540-54919-6
    URL: http://dx.doi.org/10.1007/3-540-54919-6
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 3540249796?
Did you mean 3540509496?
Did you mean 3540109196?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages