When can we answer queries using result-bounded data interfaces?
We consider answering queries on data available through access methods, that provide lookup access to the tuples matching a given binding. Such interfaces are common on the Web; further, they often have bounds on how many results they can return, e.g., because of pagination or rate limits. We thus s...
Asıl Yazarlar: | Amarilli, A, Benedikt, MA |
---|---|
Materyal Türü: | Conference item |
Baskı/Yayın Bilgisi: |
Association for Computing Machinery
2018
|
Benzer Materyaller
-
When Can We Answer Queries Using Result-Bounded Data Interfaces?
Yazar:: Antoine Amarilli, ve diğerleri
Baskı/Yayın Bilgisi: (2022-06-01) -
Query answering with transitive and linear-ordered data
Yazar:: Amarilli, A, ve diğerleri
Baskı/Yayın Bilgisi: (2018) -
Query answering with transitive and linear-ordered data
Yazar:: Vanden Boom, M, ve diğerleri
Baskı/Yayın Bilgisi: (2016) -
Finite open-world query answering with number restrictions
Yazar:: Amarilli, A, ve diğerleri
Baskı/Yayın Bilgisi: (2020) -
Efficient Upper Bound Computation of Query Answers in Expressive Description Logics
Yazar:: Zhou, Y, ve diğerleri
Baskı/Yayın Bilgisi: (2012)