skip to main content
10.1145/1559795.1559810acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Satisfiability and relevance for queries over active documents

Authors Info & Claims
Published:29 June 2009Publication History

ABSTRACT

ManyWeb applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems [22] or when monitoring distributed autonomous systems [6]. This is a challenging problem that has generated recently a lot of attention; see Web 2.0 [38]. For capturing interactions between Web components, we use active documents interacting with the rest of the world via streams of updates. Their input streams specify updates to the document (in the spirit of RSS feeds), whereas their output streams are defined by queries on the document. In most of the paper, the focus is on input streams where the updates are only insertions, although we do consider also deletions.

We introduce and study two fundamental concepts in this setting, namely, satisfiability and relevance. Some fact is satisfiable for an active document and a query if it has a chance to be in the result of the query in some future state. Given an active document and a query, a call in the document is relevant if the data brought by this call has a chance to impact the answer to the query. We analyze the complexity of computing satisfiability in our core model (insertions only) and for extensions (e.g., with deletions). We also analyze the complexity of computing relevance in the core model.

References

  1. ]]S. Abiteboul, O. Benjelloun, B. Cautis, I. Manolescu, T. Milo, and N. Preda. Lazy query evaluation for Active XML. In SIGMOD Conference, pages 227--238, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. ]]S. Abiteboul, O. Benjelloun, and T. Milo. Positive Active XML. In PODS, pages 35--45, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. ]]S. Abiteboul, O. Benjelloun, and T. Milo. The active XML project: an overview. VLDB J., 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. ]]S. Abiteboul, P. Bourhis, and B. Marinoiu. Satifiability and relevance for queries over active documents (full version). ftp://ftp.inria.fr/INRIA/Projects/gemo/gemo/GemoReport-10019.pdf.Google ScholarGoogle Scholar
  5. ]]S. Abiteboul, P. Bourhis, and B. Marinoiu. Efficient maintenance techniques for views over active documents. In EDBT, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. ]]S. Abiteboul and B. Marinoiu. Distributed monitoring of peer to peer systems. In Workshop On Web Information And Data Management, pages 41--48, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. ]]S. Abiteboul, B. Marinoiu, and P. Bourhis. Distributed Monitoring of Peer to Peer Systems (demo). In ICDE, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. ]]S. Abiteboul, L. Segoufin, and V. Vianu. Representing and querying xml with incomplete information. ACM Trans. Database Syst., 31(1):208--254, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. ]]S. Abiteboul, L. Segoufin, and V. Vianu. Static analysis of Active XML systems. In PODS, pages 221--230, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. ]]Active XML. http://activexml.net.Google ScholarGoogle Scholar
  11. ]]C. Beeri and R. Ramakrishnan. On the power of magic. J. Log. Program., 10(3-4):255--299, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. ]]M. Benedikt, W. Fan, and F. Geerts. Xpath satisfiability in the presence of dtds. In PODS '05, pages 25--36, New York, NY, USA, 2005. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. ]]H. Björklund, W. Martens, and T. Schwentick. Conjunctive query containment over trees. In DBPL, pages 66--80, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. ]]H. Björklund, W. Martens, and T. Schwentick. Optimizing conjunctive queries over trees using schema information. In MFCS, pages 132--143, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. ]]J. A. Blakeley, N. Coburn, and P.-Å. Larson. Updating derived relations: Detecting irrelevant and autonomously computable updates. In VLDB'86, pages 457--466, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. ]]J. A. Blakeley, P.-A. Larson, and F. W. Tompa. Efficiently updating materialized views. SIGMOD Rec., 15(2):61--71, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. ]]A. Calì and D. Martinenghi. Querying data under access limitations. In ICDE, pages 50--59, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. ]]H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997. release October, 1rst 2002.Google ScholarGoogle Scholar
  19. ]]C. David. Complexity of data tree patterns over xml documents. In MFCS, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. ]]Y. Diao, P. M. Fischer, M. J. Franklin, and R. To. Yfilter: Efficient and scalable filtering of XML documents. In ICDE, pages 341--, 2002.Google ScholarGoogle Scholar
  21. ]]DTD. http://www.w3.org/tr/rec-xml/#dt-doctype.Google ScholarGoogle Scholar
  22. ]]R. Ennals and D. Gay. User-friendly functional programming for Web mashups. In ICFP, pages 223--234, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. ]]A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63--92, Apr. 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. ]]B. Genest, A. Muscholl, O. Serre, and M. Zeitoun. Tree pattern rewriting systems. In ATVA, pages 332--346, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. ]]G. Gottlob and C. Koch. Monadic queries over tree-structured data. In LICS, pages 189--202, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. ]]G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. ACM Trans. Database Syst., 30(2):444--491, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. ]]G. Grahne. Problem of Incomplete Information in Relational Databases. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. ]]T. Imielinski and J. W. Lipski. The relational model of data and cylindrical algebras. In PODS '82: Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems, pages 170--170, New York, NY, USA, 1982. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. ]]C. A. K. and V. M. Y. The implication problem for functional and inclusion dependencies is undecidable. SIAM journal on computing, 14(3):pp. 671--677, 1985.Google ScholarGoogle Scholar
  30. ]]P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. J. Comput. Syst. Sci., 51(1):26--52, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. ]]R. Kapuscinski, R. Q. Zhang, P. Carbonneau, R. Moore, and B. Reeves. Inventory decisions in Dell's supply chain. Interfaces, 34(3):191--205, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. ]]A. Y. Levy. Obtaining complete answers from incomplete databases. In In Proc. of the 22nd Int. Conf. on Very Large Data Bases (VLDB'96, pages 402--412, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. ]]A. Y. Levy and Y. Sagiv. Queries independent of updates. In VLDB '93: Proceedings of the 19th International Conference on Very Large Data Bases, pages 171--181, San Francisco, CA, USA, 1993. Morgan Kaufmann Publishers Inc. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. ]]A.-T. Ma, Z.-X. Hao, and Y. Zhu. Checking satisfiability of tree pattern queries for active xml documents. In INFOCOMP, pages 11--18, 2008.Google ScholarGoogle Scholar
  35. ]]G. Miklau and D. Suciu. Containment and equivalence for a fragment of XPath. J. ACM, 51(1):2--45, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. ]]A. Muscholl, T. Schwentick, and L. Segoufin. Active context-free games. In STACS, pages 452--464, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  37. ]]H. Seidl, T. Schwentick, and A. Muscholl. Numerical document queries. In PODS '03: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 155--166, New York, NY, USA, 2003. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. ]]What Is Web 2.0. http://www.oreilly.com/.Google ScholarGoogle Scholar
  39. ]]WSDL. http://www.w3.org/tr/wsdl.Google ScholarGoogle Scholar

Index Terms

  1. Satisfiability and relevance for queries over active documents

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
          June 2009
          298 pages
          ISBN:9781605585536
          DOI:10.1145/1559795
          • General Chair:
          • Jan Paredaens,
          • Program Chair:
          • Jianwen Su

          Copyright © 2009 ACM

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 29 June 2009

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate476of1,835submissions,26%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!