Querying Visible and Invisible Information
We provide a wide-ranging study of the scenario where a subset of the relations in the schema are visible --- that is, their complete contents are known --- while the remaining relations are invisible. We also have integrity constraints (invariants given by logical sentences) which may relate the vi...
Uložené v:
| Vydané v: | Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science s. 297 - 306 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY, USA
ACM
05.07.2016
|
| Edícia: | ACM Conferences |
| Predmet: | |
| ISBN: | 9781450343916, 1450343910 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We provide a wide-ranging study of the scenario where a subset of the relations in the schema are visible --- that is, their complete contents are known --- while the remaining relations are invisible. We also have integrity constraints (invariants given by logical sentences) which may relate the visible relations to the invisible ones. We want to determine which information about a query (a positive existential sentence) can be inferred from the visible instance and the constraints. We consider both positive and negative query information, that is, whether the query or its negation holds. We consider the instance-level version of the problem, where both the query and the visible instance are given, as well as the schema-level version, where we want to know whether truth or falsity of the query can be inferred in some instance of the schema. |
|---|---|
| AbstractList | We provide a wide-ranging study of the scenario where a subset of the relations in the schema are visible --- that is, their complete contents are known --- while the remaining relations are invisible. We also have integrity constraints (invariants given by logical sentences) which may relate the visible relations to the invisible ones. We want to determine which information about a query (a positive existential sentence) can be inferred from the visible instance and the constraints. We consider both positive and negative query information, that is, whether the query or its negation holds. We consider the instance-level version of the problem, where both the query and the visible instance are given, as well as the schema-level version, where we want to know whether truth or falsity of the query can be inferred in some instance of the schema. |
| Author | Bourhis, Pierre Benedikt, Michael ten Cate, Balder Puppis, Gabriele |
| Author_xml | – sequence: 1 givenname: Michael surname: Benedikt fullname: Benedikt, Michael – sequence: 2 givenname: Pierre surname: Bourhis fullname: Bourhis, Pierre – sequence: 3 givenname: Balder surname: ten Cate fullname: ten Cate, Balder – sequence: 4 givenname: Gabriele surname: Puppis fullname: Puppis, Gabriele |
| BookMark | eNqNj01LxDAURQMqqGPXbrsUofW9JC8fSxl0LAyIoG5DMpNIdSaBdhT891bsD3B1udzDhXPOjnPJkbFLhBZR0g23QpCmdkoSoI5YZbWZBhBSWFSnrBrHdwDgqI0FPGPXT59x-O7zW_3aj33Yxdrnbd3lr7l1OZVh7w99yRfsJPndGKs5F-zl_u55-dCsH1fd8nbdeAH80JCM0VBMwLmRPJHeKDIWDXjSSRjvtzKg1doECEkG6YkSmqhVMqgiBrFgV3-_frN3oZSP0SG4Xz0367lZb0Lbf6IuDH1M4gftJ1Dq |
| ContentType | Conference Proceeding |
| Copyright | 2016 ACM |
| Copyright_xml | – notice: 2016 ACM |
| DOI | 10.1145/2933575.2935306 |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EndPage | 306 |
| GroupedDBID | 6IE 6IF 6IG 6IL 6IN AAJGR ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI IEGSK IJVOP OCL RIB RIC RIE RIL RIO |
| ID | FETCH-LOGICAL-a302t-54ee85ef022842f57c6589180a57f38aad4b19778b0bf4b4a55f18e76f816e1b3 |
| ISBN | 9781450343916 1450343910 |
| ISICitedReferencesCount | 18 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000387609200030&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Jan 31 06:44:04 EST 2024 Wed Jan 31 06:49:57 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| License | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org |
| LinkModel | OpenURL |
| MeetingName | LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science |
| MergedId | FETCHMERGED-LOGICAL-a302t-54ee85ef022842f57c6589180a57f38aad4b19778b0bf4b4a55f18e76f816e1b3 |
| OpenAccessLink | https://hal.science/hal-01411118 |
| PageCount | 10 |
| ParticipantIDs | acm_books_10_1145_2933575_2935306 acm_books_10_1145_2933575_2935306_brief |
| PublicationCentury | 2000 |
| PublicationDate | 20160705 |
| PublicationDateYYYYMMDD | 2016-07-05 |
| PublicationDate_xml | – month: 07 year: 2016 text: 20160705 day: 05 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA |
| PublicationSeriesTitle | ACM Conferences |
| PublicationTitle | Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science |
| PublicationYear | 2016 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssj0002178901 |
| Score | 2.1160157 |
| Snippet | We provide a wide-ranging study of the scenario where a subset of the relations in the schema are visible --- that is, their complete contents are known ---... |
| SourceID | acm |
| SourceType | Publisher |
| StartPage | 297 |
| SubjectTerms | Information systems Information systems -- Data management systems Information systems -- Data management systems -- Database design and models Information systems -- Data management systems -- Database management system engines Information systems -- Data management systems -- Database management system engines -- Database query processing Information systems -- Data management systems -- Query languages Theory of computation Theory of computation -- Theory and algorithms for application domains Theory of computation -- Theory and algorithms for application domains -- Database theory Theory of computation -- Theory and algorithms for application domains -- Database theory -- Database query processing and optimization (theory) |
| Title | Querying Visible and Invisible Information |
| WOSCitedRecordID | wos000387609200030&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEBZtyCGntnmQ9IULhUKCE2tlWfKxXdL20F0S8iA3Y9kSLMm6ix9L-u87I8teZwkkPfTi9Qpbxv7Gmk_WfDOEfE55Dn5UZ76iI-OHXGhfgdv0R1mes5hqcOo2Zf4vMZ3Km5u4W9GtbDkBURTy_j5e_FeooQ3ARunsP8DddwoNsA-gwxZgh-0aI37U-Zz1jVW3_s9oVR-5RPpfxxPoGqd4Rxd_5hiy1cxxwQBrLmetBLAt89C99UObOm90aWVR1zN4k-60CyZeun9O2jRc2v8GQ2k-u63XI_RtgGJTumLIZ-CbV0G4wOJRmKjb5RCsIt6P381i0Z7xI1UlSuPbQRGTNVdgVZOBgPHB9wwa2dhXPrDAyYMpLg15wKw8eDjMtjG9zmMzm7PgEWcQYt4M4DMMOOkx_HKGydlfCkFboV__MQ7mZRKIkRX-ucv1-cC6y7u8UNBwstYlEptsPqAll6_J7up-vRXwb8gLXWyTVx2UnoNyhxx2CHoOQQ8Q9HoEvQGCu-Tq--nl-KfvqmX4KQtGtc9DrSXXBhMahSPDRRZhxUgZpFwYJtM0DxUFti9VoEyowpRzQ6UWkZE00lSxPbJR_C70PvEUNcAjObA3o3H-n0YyFrEI4JxYSZEdkE9wwwkafZW0ynaeuIeSuIdyQL48eUyCpmLePqO3d2RrZSvvyUZdNvoD2cyW9awqP1ow_wLE3Fed |
| linkProvider | IEEE |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+31st+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=Querying+Visible+and+Invisible+Information&rft.au=Benedikt%2C+Michael&rft.au=Bourhis%2C+Pierre&rft.au=ten+Cate%2C+Balder&rft.au=Puppis%2C+Gabriele&rft.series=ACM+Conferences&rft.date=2016-07-05&rft.pub=ACM&rft.isbn=9781450343916&rft.spage=297&rft.epage=306&rft_id=info:doi/10.1145%2F2933575.2935306 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450343916/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450343916/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450343916/sc.gif&client=summon&freeimage=true |