The Complexity of regular expressions and property paths in sparql

ACM Transactions on Database Systems

Volumn 38, Issue 4, 2013, Pages

  Losemann, Katja ^a   Martens, Wim ^a  

^a UNIVERSITY OF BAYREUTH   (Germany)

Author keywords

Graph databases; Query evaluation; Regular expressions

Indexed keywords

ALTERNATIVE SEMANTICS; GRAPH DATABASE; GRAPH-STRUCTURED DATUM; NUMERICAL OCCURRENCE INDICATORS; POLYNOMIAL-TIME; QUERY EVALUATION; REGULAR EXPRESSIONS; SYNTACTIC SUGARS;

PATTERN MATCHING; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES; SEMANTICS;

GRAPH THEORY;

EID: 84890733454     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/2494529     Document Type: Conference Paper

References (54)

1. ABITEBOUL, S., QUASS, D., MCHUGH, J., WIDOM, J., AND WIENER, J. L. 1997. The Lorel query language for semistructured data. Int. J. Digital Libraries 1, 1, 68-88
2. ABITEBOUL, S. AND VIANU, V. 1999. Regular path queries with constraints. J. Comput. Syst. Sci. 58, 3, 428-452
3. ALECHINA, N. AND IMMERMAN, N. 2000. Reachability logic: An efficient fragment of transitive closure logic. Logic J. IGPL 8, 3, 325-337
4. ALKHATEEB, F., BAGET, J.-F., AND EUZENAT, J. 2009. Extending SPARQL with regular expression patterns (for querying RDF). J. Web Semantics 7, 2, 57-73
5. ALVAREZ, C. AND JENNER, B. 1993. A very hard log-space counting class. Theor. Comput. Sci. 107, 1, 3-30
6. ARENAS, M., CONCA, S., AND PEREZ, J. 2012. Counting beyond a yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard. In Proceedings of the International World Wide Web Conference (WWW'12). ACM Press, New York, 629-638
7. ARENAS, M. AND PEREZ, J. 2011. Querying semantic web data with SPARQL. In Proceedings of the Symposium on Principles of Database Systems (PODS'11). ACM Press, New York, 305-316
8. BAGAN, G., BONIFATI, A., AND GROZ, B. 2013. A trichotomy for regular simple path queries on graphs. In Proceedings of the Symposium on Principles of Database Systems (PODS'13). ACM Press, New York
9. BERGE, C. 1973. Graphs and Hypergraphs. North-Holland Publishing Company
10. BEX, G. J.,NEVEN, F., SCHWENTICK, T., AND VANSUMMEREN, S. 2010. Inference of concise regular expressions and DTDS. ACM Trans. Datab. Syst. 35, 2, 11:1-11:47
11. BOOK, R.,EVEN, S.,GREIBACH, S., AND OTT, G. 1971. Ambiguity in graphs and expressions. IEEE Trans. Comput. 20, 2, 149-153
12. BRAY, T., PAOLI, J., SPERBERG-MCQUEEN, MALER, C. M. E., AND YERGEAU, F. 2008. Extensible markup language xml 1.0, 5th ed. Tech. rep. WorldWideWeb Consortium (W3C). http://www.w3.org/TR/2008/REC-xml-20081126/
13. BUNEMAN, P., DAVIDSON, S. B., HILLEBRAND, G. G., AND SUCIU, D. 1996. A query language and optimization techniques for unstructured data. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'96). ACM Press, New York, 505-516
14. CALVANESE, D., DE GIACOMO, G., LENZERINI, M., AND VARDI, M. Y. 2002. Rewriting of regular expressions and regular path queries. J. Comput. Syst. Sci. 64, 3, 443-465
15. CALVANESE, D., DE GIACOMO, G., LENZERINI, M., AND VARDI, M. Y. 2000a. Containment of conjunctive regular path queries with inverse. In Principles of Knowledge Representation and Reasoning (KR). Morgan Kaufmann, 176-185
16. CALVANESE, D., DE GIACOMO, G., LENZERINI, M., AND VARDI, M. Y. 2000b. View-based query processing for regular path queries with inverse. In Proceedings of the Symposium on Principles of Database Systems (PODS'00). ACM Press, New York, 58-66
17. CLEAVELAND, R. AND STEFFEN, B. 1993. A linear-time model-checking algorithm for the alternation-free modal mu-calculus. Formal Methods Syst. Des. 2, 2, 121-147
18. COLAZZO, D., GHELLI, G., AND SARTIANI, C. 2009a. Efficient asymmetric inclusion between regular expression types. In Proceedings of the International Conference Database Theory (ICDT'09). ACM Press, New York, 174-182
19. COLAZZO, D., GHELLI, G., AND SARTIANI, C. 2009b. Efficient inclusion for a class of xml types with interleaving and counting. Inf. Syst. 34, 7, 643-656
20. CONSENS,M. P. ANDMENDELZON, A.O. 1990. GraphLog: A visual formalism for real life recursion. In Proceedings of the Symposium on Principles of Database Systems (PODS'90). ACM Press, New York, 404-416
21. CRUZ, I. F., MENDELZON, A.O., AND WOOD, P. T. 1987. A graphical query language supporting recursion. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'87). ACM Press, New York, 323-330
22. DEUTSCH, A. AND TANNEN, V. 2001. Optimization properties for classes of conjunctive regular path queries. In Proceedings of the International Workshop on Database Programming Languages (DBPL'01). Springer, 1-39
23. FALLSIDE, D. AND WALMSLEY, P. 2004. XML schema part 0: Primer, 2nd ed. Tech. rep., World Wide Web Consortium. http://www.w3.org/TR/2004/REC-xmlschema- 0-20041028/
24. FERNANDEZ, M. F., FLORESCU, D., LEVY, A, Y., AND SUCIU, D. 2000. Declarative specification of web sites with strudel. Very Large Datab. J. 9, 1, 38-55
25. FLORESCU, D., LEVY, A. Y., AND SUCIU, D. 1998. Query containment for conjunctive queries with regular expressions. In Proceedings of the Symposium on Principles of Database Systems (PODS'98). ACM Press, New York, 139-148
26. GAO, S., SPERBERG-MCQUEEN, C. M., THOMPSON, H. S.,MENDELSOHN, N., BEECH, D., AND MALONEY, M. 2009. W3C XML schema definition language (XSD) 1.1 part 1: Structures. Tech. rep., World Wide Web Consortium. http://www.w3.org/TR/2009/CR- xmlschema11-1-20090430/
27. GELADE, W., GYSSENS, M., AND MARTENS, W. 2012. Regular expressions with counting: Weak versus strong determinism. SIAM J. Comput. 41, 1, 160-190
28. GELADE, W.,MARTENS, W., AND NEVEN, F. 2009. Optimizing schema languages for XML: Numerical constraints and interleaving. SIAM J. Comput. 38, 5, 2021-2043
29. GLUSHKOV, V. M. 1961. The abstract theory of automata. Russian Math. Surv. 16, 5, 1-53
30. HARRIS, S. AND SEABORNE, A. 2010. SPARQL 1.1 query language. Tech. rep., World Wide Web Consortium (W3C). http://www.w3.org/TR/2010/WD-sparql11-query- 20100601/
31. HARRIS, S. AND SEABORNE, A. 2012. SPARQL 1.1 query language. Tech. rep.,World Wide Web Consortium (W3C). http://www.w3.org/TR/2012/WD-sparql11- query-20120105/
32. HOPCROFT, J. E. AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Boston, MA
33. KANNAN, S., SWEEDYK, Z., AND MAHANEY, S. R. 1995. Counting and random generation of strings in regular languages. In Proceedings of the Symposium on Discrete Algorithms (SODA'95). SIAMS, 551-557
34. KILPELAINEN, P. AND TUHKANEN, R. 2003. Regular expressions with numerical occurrence indicators- Preliminary results. In Proceedings of the Symposium on Programming Languages and Software Tools (SPLST'03). 63-173
35. KILPELAINEN, P. AND TUHKANEN, R. 2007. One-unambiguity of regular expressions with numeric occurrence indicators. Inf. Comput. 205, 6, 890-916
36. KLEENE, S. C. 1956. Representations of events in nerve sets and finite automata. In Automata Studies, Princeton University Press, Princeton, NJ, 3-42
37. LAPAUGH, A. S. AND PAPADIMITRIOU, C. H. 1984. The even-path problem for graphs and digraphs. Netw. 14, 4, 507-513. http://onlinelibrary.wiley.com/doi/ 10.1002/net.3230140403/abstract
38. LIBKIN, L., MARTENS, W., AND VRGOC, D. 2013. Querying graph databases with Xpath. In Proceedings of the International Conference on Database Theory (ICDT'13). ACM Press, New York, 129-140
39. LIBKIN, L. AND VRGOC, D. 2012. Regular path queries on graphs with data. In Proceedings of the International Conference on Database Theory (ICDT'12). ACM Press, New York, 74-85
40. LIU, Y. A. AND YU, F. 2002. Solving regular path queries. In Proceedings of the 6th International on Conference on Mathematics of Program Construction (MPC'02). Springer, 195-208
41. LIBKIN, L., MARTENS, W., AND VRGOC, D. 2013. Querying graph databases with Xpath. In Proceedings of the International Conference on Database Theory (ICDT'13). ACM Press, New York, 129-140
42. LIBKIN, L. AND VRGOC, D. 2012. Regular path queries on graphs with data. In Proceedings of the International Conference on Database Theory (ICDT'12). ACM Press, New York, 74-85
43. LIU, Y. A. AND YU, F. 2002. Solving regular path queries. In Proceedings of the 6th International on Conference on Mathematics of Program Construction (MPC'02). Springer, 195-208
44. LOSEMANN, K. AND MARTENS,W. 2012. The complexity of evaluating path expressions in sparql. In Proceedings of the Symposium on Principles of Database Systems (PODS'12). ACM Press, New York, 101-112
45. MARTENS, W.,NEVEN, F., AND SCHWENTICK, T. 2004. Complexity of decision problems for simple regular expressions. In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS'04). Springer, 889-900
46. MARTENS, W., NEVEN, F., AND SCHWENTICK, T. 2009. Complexity of decision problems for XML schemas and chain regular expressions. SIAM J. Comput. 39, 4, 1486-1530
47. MENDELZON, A. O. AND WOOD, P. T. 1995. Finding regular simple paths in graph databases. SIAM J. Comput. 24, 6, 1235-1258
48. PEREZ, J., ARENAS, M., AND GUTIERREZ, C. 2009. Semantics and complexity of SPARQL. ACM Trans. Database Syst. 34, 3, 16:1-16:45
49. PEREZ, J., ARENAS, M., AND GUTIERREZ, C. 2010. nSPARQL: A navigational language for RDF. J. Web Semantics 8, 4, 255-270
50. RAMAKRISHNAN, R. AND GEHRKE, J. 2003. Database Management Systems 3rd Ed. McGraw-Hill, New York
51. SCHMIDT, M.,MEIER, M., AND LAUSEN, G. 2010. Foundations of sparql query optimization. In Proceedings of the International Conference on Database Theory (ICDT'10). ACM Press, New York, 4-33
52. STOCKMEYER, L. 1974. The complexity of decision problems in automata theory and logic. Ph.D. dissertation, Massachusetts Institute of Technology. http://people.csail.mit.edu/meyer/Stockmeyer-thesis.pdf
53. VALIANT, L. G. 1979. The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 3, 410-421
54. YANNAKAKIS, M. 1990. Graph-theoretic methods in database theory. In Proceedings of the Symposium on Principles of Database Systems (PODS'90). ACM Press, New York, 230-242