at Google ScholarTitle data
Losemann, Katja ; Martens, Wim:
The complexity of evaluating path expressions in SPARQL.
In:
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems. -
New York
,
2012
. - pp. 101-112
ISBN 978-1-4503-1248-6
DOI: https://doi.org/10.1145/2213556.2213573
Project information
| Project financing: |
Deutsche Forschungsgemeinschaft |
|---|
Further data
| Item Type: | Article in a book |
|---|---|
| Refereed: | Yes |
| Institutions of the University: | Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Computer Science > Professor Applied Computer Science VII > Professor Applied Computer Science VII - Univ.-Prof. Dr. Wim Martens Research Institutions > Research Centres > Forschungszentrum für Modellbildung und Simulation (MODUS) Faculties Faculties > Faculty of Mathematics, Physics und Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Computer Science Faculties > Faculty of Mathematics, Physics und Computer Science > Department of Computer Science > Professor Applied Computer Science VII Research Institutions Research Institutions > Research Centres |
| Result of work at the UBT: | Yes |
| DDC Subjects: | 000 Computer Science, information, general works > 004 Computer science |
| Date Deposited: | 14 Oct 2019 06:39 |
| Last Modified: | 14 Oct 2019 06:39 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/52580 |