Checking well-definedness of XQueries

Channel:
Microsoft Research
Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=WzQ1VGYQN0s


Duration: 47:48
8 views
0

XQuery is the upcoming standard language for querying XML data. The dynamic semantics of XQuery is defined in such a way that the evaluation of an XQuery expression may crash (raise a run-time error). When an XQuery never crashes we say that it is well-defined. Automatic checking for well-definedness is, of course, undecidable. Nevertheless, for certain interesting fragments of XQuery that are similar in expressiveness to standard relational query languages, well-definedness can become decidable. Important choices in this respect are whether we use a set- or a list-semantics for XML data, and whether we follow the XQuery convention to identify a single element with the list consisting of only that element.



Other Videos By Microsoft Research


2016-09-05Uncovering Semantic Similarities between Query Terms
2016-09-0550/50 by 2020 -- Living Anita's vision and the importance of gender equity in technology
2016-09-05Online Auctions, Strategyproofness and Random Valuations
2016-09-05Citrine Smart Clipboard, WhyLine Interrogative Debugging, EdgeWrite Text Entry, and Pebbles PocketPC
2016-09-05Because it is there: Kili the Right Way
2016-09-05Music-specific audio content analysis
2016-09-05Hierarchical Dirichlet Processes
2016-09-05Phase-Aware Program Profiling
2016-09-05Collaborative Algorithms for a Class of Clustered Wireless Networks
2016-09-05Computer Consciousness
2016-09-05Checking well-definedness of XQueries
2016-09-05The Role of Template Engines in Code Generation
2016-09-05Anomalous Diffusion and Polya Recurrence
2016-09-05Designing for Intimacy: Interaction Research at the Human Communication Technologies Laboratory
2016-09-05Breaking the Frame: Novel Strategies for Interactive Computer Graphics [1/33]
2016-09-05Single and Multiple Document Summarization with Graph-based Ranking Algorithms
2016-09-05Sharp thresholds for random constraint satisfaction problems [1/3]
2016-09-05A Unification of Menger's and Edmonds' Theorems and Network Coding Theorems
2016-09-05Statistical Learning and Analysis for Unconstrained Face Recognition
2016-09-05A Novel Approach to Sequence Analysis using Assign-SBTTM Software Improves Heterozygous Base Calling
2016-09-05Convergence in competitive Games


Tags:
microsoft research