|
|
|
     |
                                     |
Return to XML
A query against a database behind a site like Napster may search, e.g., for all users who have downloaded more jazz titles than pop music titles. In order to express such queries, we extend classical monadic second-order logic by Presburger predicates which pose numerical restrictions on the children (content) of an element node and provide a precise automata-theoretic characterization. While the existential fragment of the resulting logic is decidable, it turns out that satisfiability of the full logic is undecidable. Decidable satisfiability and a querying algorithm even with linear data complexity can be obtained if numerical constraints are only applied to those contents of elements where ordering is irrelevant. Finally, it is sketched how these techniques can be extended also to answer questions like, e.g., whether the total price of the jazz music downloaded so far exceeds a user's budget.
@inproceedings {DBLP:conf/pods/SeidlSM03, author = {Helmut Seidl and Thomas Schwentick and Anca Muscholl}, booktitle = {PODS}, title = {Numerical document queries.}, pages = {155-166}, year = {2003}, url = {db/conf/pods/pods2003.html#SeidlSM03}, ee = {http://doi.acm.org/10.1145/773153.773169}, crossref = {conf/pods/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2004 Association for Computing Machinery |
