Michael Benedikt
Abstract
We study the design of data publishing mechanisms that allow a collection of autonomous distributed data sources to collaborate to support queries. A common mechanism for data publishing is via views: functions that expose derived data to users, usually specified as declarative queries. Our autonomy assumption is that the views must be on individual sources, but with the intention of supporting integrated queries. In deciding what data to expose to users, two considerations must be balanced. The views must be sufficiently expressive to support queries that users want to ask—the utility of the publishing mechanism. But there may also be some expressiveness restrictions. Here, we consider two restrictions, a minimal information requirement, saying that the views should reveal as little as possible while supporting the utility query, and a non-disclosure requirement, formalizing the need to prevent external users from computing information that data owners do not want revealed. We investigate the problem of designing views that satisfy both expressiveness and inexpressiveness requirements, for views in a restricted information systems - query languages (conjunctive queries), and for arbitrary views.
- [1] . 1995. Foundations of Databases. Addison-Wesley. Google Scholar
Digital Library
- [2] . 2011. Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries. Theory Comput. Syst. 49, 2 (2011), 489–564. Google ScholarDigital Library
- [3] . 2014. Extending acyclicity notions for existential rules. In Proceedings of the ECAI. Google ScholarDigital Library
- [4] . 2011. Walking the complexity lines for generalized guarded existential rules. In Proceedings of the IJCAI. Google ScholarDigital Library
- [5] . 2018. Some model theory of guarded nengation. J. Symbol. Logic 83, 4 (2018), 1307–1344.Google ScholarCross Ref
- [6] . 2017. SMCQL: Secure query processing for private data networks. In Proceedings of the VLDB.Google Scholar
- [7] . 2019. Reasoning about disclosure in data integration in the presence of source constraints. In Proceedings of the IJCAI. Google ScholarDigital Library
- [8] . 2016. Querying visible and invisible information. In Proceedings of the LICS. Google ScholarDigital Library
- [9] . 2018. Logical foundations of information disclosure in ontology-based data integration. Artif. Intell. 262 (2018), 52–95.Google ScholarDigital Library
- [10] . 2016. Generating plans from proofs. In Proceedings of the TODS.Google ScholarDigital Library
- [11] . 2013. A confidentiality model for ontologies. In Proceedings of the ISWC. Google ScholarDigital Library
- [12] . 2012. View-based query answering in description logics: Semantics and complexity. J. Comput. Syst. Sci. 78, 1 (2012), 26–46. Google ScholarDigital Library
- [13] . 1988. Multiparty unconditionally secure protocols. In Proceedings of the STOC. Google ScholarDigital Library
- [14] . 2013. Acyclicity notions for existential rules and their application to query answering in ontologies. J. Artific. Intell. Res. 47 (2013), 741–808. Google ScholarDigital Library
- [15] . 2008. The chase revisited. In Proceedings of the PODS. Google ScholarDigital Library
- [16] . 2006. Differential privacy. In Proceedings of the ICALP. Google ScholarDigital Library
- [17] . 2014. The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9, 3&4 (
Aug. 2014), 211–407. Google ScholarDigital Library - [18] . 2005. Data exchange: Semantics and query answering. Theor. Comput. Sci. 336, 1 (2005), 89–124. Google ScholarDigital Library
- [19] . 2015. The hunt for a red spider: Conjunctive query determinacy is undecidable. In Proceedings of the LICS. Google ScholarDigital Library
- [20] . 2016. Red spider meets a rainworm: Conjunctive query finite determinacy is undecidable. In Proceedings of the PODS. Google ScholarDigital Library
- [21] . 2001. Answering queries using views: A survey. Very Large Data Base J. 10, 4 (2001), 270–294. Google ScholarDigital Library
- [22] . 1984. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28, 1 (1984).Google ScholarCross Ref
- [23] . 2015. Query-based data pricing. J. ACM 62, 5 (2015). Google ScholarDigital Library
- [24] . 2017. A theory of pricing private data. Commun. ACM 60, 12 (2017), 79–86. Google ScholarDigital Library
- [25] . 1979. Testing implications of data dependencies. Trans. Database Syst. 4, 4 (1979), 455–469. Google ScholarDigital Library
- [26] . 2009. Generalized schema-mappings: From termination to tractability. In Proceedings of the PODS. Google ScholarDigital Library
- [27] . 2007. Privacy in GLAV information integration. In Proceedings of the ICDT. Google ScholarDigital Library
- [28] . 2010. Views and queries: Determinacy and rewriting. Trans. Database Syst. 35, 3 (2010). Google ScholarDigital Library
- [29] . 2013. The chase procedure and its applications in data exchange. In Proceedings of the DEIS. 1–37.Google Scholar
Index Terms
- Balancing Expressiveness and Inexpressiveness in View Design
Recommendations
Determinacy and query rewriting for conjunctive queries and views
Answering queries using views is the problem which examines how to derive the answers to a query when we only have the answers to a set of views. Constructing rewritings is a widely studied technique to derive those answers. In this paper we consider ...
Asymptotic Determinacy of Path Queries Using Union-of-Paths Views
We consider the view-based query determinacy problem over graph databases for queries defined as unions of path queries. These queries select pairs of nodes in a graph that are connected through a path whose length falls in a given set. A view ...
Cloaking data to ease view creation, query expression, and query execution
Conceptual Modelling and Its Theoretical FoundationsXML schemas often allow many aspects of an object to be described in the same document, but queries over such documents might be concerned with just one aspect. For example, an XML representation of a spreadsheet can include both spreadsheet data and ...
Comments