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...
Päätekijät: | Amarilli, A, Benedikt, MA |
---|---|
Aineistotyyppi: | Conference item |
Julkaistu: |
Association for Computing Machinery
2018
|
Samankaltaisia teoksia
-
When Can We Answer Queries Using Result-Bounded Data Interfaces?
Tekijä: Antoine Amarilli, et al.
Julkaistu: (2022-06-01) -
Query answering with transitive and linear-ordered data
Tekijä: Amarilli, A, et al.
Julkaistu: (2018) -
Query answering with transitive and linear-ordered data
Tekijä: Vanden Boom, M, et al.
Julkaistu: (2016) -
Finite open-world query answering with number restrictions
Tekijä: Amarilli, A, et al.
Julkaistu: (2020) -
Efficient Upper Bound Computation of Query Answers in Expressive Description Logics
Tekijä: Zhou, Y, et al.
Julkaistu: (2012)