ACM Home Page
Please provide us with feedback. Feedback
A call to regularity
Full text PdfPdf (20 KB)
Source ACM International Conference Proceeding Series; Vol. 41 archive
Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday table of contents
San Diego, California, USA
Pages: 11 - 11  
Year of Publication: 2003
ISBN:1-58113-604-8
Author
Moshe Y. Vardi  Rice University, Houston, TX
Sponsors
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/778348.778352
What is a DOI?

ABSTRACT

From the mid 1980s to the mid 1990s, with the active involvement of Paris C. Kanellakis, a major theme in database theory was the study of Datalog, the language of logic programs without function symbols. Unfortunately, most decision problems involving Datalog turned out to be undecidable. Furthermore, well-behaved fragments of Datalog turned out to be rather restrictive and unnatural. Surprisingly, a natural and quite general fragment of Datalog did emerge in the mid 1990s, in the context of semistructured data. This fragment is the class of regular queries, whose basic element is that of regular path queries. In this talk I describe the class of regular queries and its well-behavedness in the context of view-based query processing.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
D. Calvanese, G. De~Giacomo, M. Lenzerini, and M. Y. Vardi. Containment of conjunctive regular path queries with inverse. In Proc. of the 7th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR~2000), pages 176--185, 2000.
4
 
5
 
6
D. Calvanese, G. De~Giacomo, M. Lenzerini, and M. Y. Vardi. What is query rewriting? In Proc. of the 7th Int. Workshop on Knowledge Representation meets Databases (KRDB~2000), pages 17--27. CEUR Electronic Workshop Proceedings, http://ceur-ws.org/Vol-29/, 2000.
7
 
8
9