503 results on '"Leonid Libkin"'
Search Results
52. Negative Knowledge for Certain Query Answers.
53. How Standard is the SQL Standard?
54. A Formal Semantics of SQL Queries, Its Validation, and Applications.
55. Correctness of SQL Queries on Databases with Nulls.
56. SQL's Three-Valued Logic and Certain Answers.
57. Path Logics for Querying Graphs: Combining Expressiveness and Efficiency.
58. How to Define Certain Answers.
59. SQL's Handling of Nulls: Can It Be Fixed?
60. A Researcher’s Digest of GQL (Invited Talk)
61. On the Codd Semantics of SQL Nulls.
62. Certain answers as objects and knowledge.
63. Research Directions for Principles of Data Management (Abridged).
64. Querying Graphs with Data.
65. SQL's Three-Valued Logic and Certain Answers.
66. Synchronizing Relations on Words.
67. On scale independence for querying big data.
68. Incomplete data: what went wrong, and how to fix it.
69. Pattern logics and auxiliary relations.
70. Formal Semantics of the Language Cypher.
71. Data Context Informed Data Wrangling.
72. Regular expressions for data words.
73. Certain Answers over Incomplete XML Documents: Extending Tractability Boundary.
74. Synchronizing Relations on Words.
75. Regular Expressions with Binding over Data Words for Querying Graph Databases.
76. When is naive evaluation possible?
77. Trial for RDF: adapting graph query languages for RDF data.
78. Querying graph databases with XPath.
79. Containment of pattern-based queries over data trees.
80. Static Analysis and Query Answering for Incomplete Data Trees with Constraints.
81. Reasoning About Pattern-Based XML Queries.
82. Efficient approximations of conjunctive queries.
83. Regular path queries on graphs with data.
84. On the complexity of query answering over incomplete XML documents.
85. Graph Logics with Rational Relations and the Generalized Intersection Problem.
86. Regular Expressions for Data Words.
87. On Low Treewidth Approximations of Conjunctive Queries.
88. Parameterized Regular Expressions and Their Languages.
89. Querying graph patterns.
90. Incomplete information and certain answers in general data models.
91. Efficient reasoning about data trees via integer linear programming.
92. Tractable XML data exchange via relations.
93. Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems.
94. Expressive languages for path queries over graph-structured data.
95. Certain answers for XML queries.
96. On the tradeoff between mapping and querying power in XML data exchange.
97. On the aggregation problem for synthesized web services.
98. On the Satisfiability of Two-Variable Logic over Data Words.
99. Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151).
100. The finite model theory toolbox of a database theoretician.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.