148 results on '"Leonid Libkin"'
Search Results
2. SQL Nulls and Two-Valued Logic.
3. GPC: A Pattern Calculus for Property Graphs.
4. Querying Incomplete Numerical Data: Between Certain and Possibile Answers.
5. A Researcher's Digest of GQL (Invited Talk).
6. Graph Pattern Matching in GQL and SQL/PGQ.
7. Certain Answers of Extensions of Conjunctive Queries by Datalog and First-Order Rewriting.
8. PG-Keys: Keys for Property Graphs.
9. Queries with Arithmetic on Incomplete Databases.
10. Coping with Incomplete Data: Recent Advances.
11. Knowledge-Preserving Certain Answers for SQL-like Queries.
12. Reasoning about Measures of Unmeasurable Sets.
13. Fragments of Bag Relational Algebra: Expressiveness and Certain Answers.
14. Measuring the Likelihood of Numerical Constraints.
15. Do We Need Many-valued Logics for Incomplete Information?.
16. Certain Answers Meet Zero-One Laws.
17. An Operational Approach to Consistent Query Answering.
18. Approximating Certainty in Querying Data and Metadata.
19. Propositional and Predicate Logics of Incomplete Information.
20. Explainable Certain Answers.
21. Cypher: An Evolving Query Language for Property Graphs.
22. Schema Mappings for Data Graphs.
23. On Querying Incomplete Information in Databases under Bag Semantics.
24. Data context informed data wrangling.
25. The VADA Architecture for Cost-Effective Data Wrangling.
26. Data Wrangling for Big Data: Challenges and Opportunities.
27. Making SQL Queries Correct on Incomplete Databases: A Feasibility Study.
28. Approximations and Refinements of Certain Answers via Many-Valued Logics.
29. Negative Knowledge for Certain Query Answers.
30. How Standard is the SQL Standard?
31. An Operational Approach to Consistent Query Answering.
32. SQL's Three-Valued Logic and Certain Answers.
33. Path Logics for Querying Graphs: Combining Expressiveness and Efficiency.
34. How to Define Certain Answers.
35. SQL's Handling of Nulls: Can It Be Fixed?
36. On the Codd Semantics of SQL Nulls.
37. Synchronizing Relations on Words.
38. On scale independence for querying big data.
39. Incomplete data: what went wrong, and how to fix it.
40. Pattern logics and auxiliary relations.
41. Regular Expressions with Binding over Data Words for Querying Graph Databases.
42. When is naive evaluation possible?
43. Trial for RDF: adapting graph query languages for RDF data.
44. Querying graph databases with XPath.
45. Containment of pattern-based queries over data trees.
46. Static Analysis and Query Answering for Incomplete Data Trees with Constraints.
47. Reasoning About Pattern-Based XML Queries.
48. Efficient approximations of conjunctive queries.
49. Regular path queries on graphs with data.
50. On the complexity of query answering over incomplete XML documents.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.