- W. Czerwinski, W. Martens, M. Niewerth, and P. Parys. Minimization of tree pattern queries. In PODS, pages 43--54. ACM, 2016. Google ScholarDigital Library
- S. Flesca, F. Furfaro, and E. Masciari. On the minimization of XPath queries. In VLDB, pages 153--164, 2003. Google ScholarCross Ref
- S. Flesca, F. Furfaro, and E. Masciari. On the minimization of XPath queries. J. ACM, 55(1):2:1--2:46, 2008.Google Scholar
- B. Kimelfeld and Y. Sagiv. Revisiting redundancy and minimization in an XPath fragment. In EDBT, pages 61--72. ACM, 2008. Google ScholarDigital Library
Recommendations
Technical Perspective: Efficient Query Processing for Dynamically Changing Datasets
The paper Efficient Query Processing for Dynamically Changing Datasets, by Muhammad Idris, Mart´n Ugarte, Stijn Vansummeren, Hannes Voigt, and Wolfgang Lehner studies two central aspects of answering queries: (1) enumerating the answers to a query and (...
Technical Perspective: Query Answers - Fewer is Faster
We often write queries using LIMIT k, indicating that only k answers are to be returned. This feature is present in most query languages, for different data models: SQL, SPARQL, Cypher etc. For example, in a repository of about 250M SPARQL queries, ...
Technical Perspective: Fair Near Neighbor Search via Sampling
One of the most important functionalities of a database system is to answer queries. We are interested in the following question: If there exists more than one answer to the given query, which one should the database report? There are two apparent ...
Comments