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.
- ]]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 Scholar
Digital Library
- ]]S. Abiteboul, O. Benjelloun, and T. Milo. Positive Active XML. In PODS, pages 35--45, 2004. Google Scholar
Digital Library
- ]]S. Abiteboul, O. Benjelloun, and T. Milo. The active XML project: an overview. VLDB J., 2008. Google Scholar
Digital Library
- ]]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 Scholar
- ]]S. Abiteboul, P. Bourhis, and B. Marinoiu. Efficient maintenance techniques for views over active documents. In EDBT, 2009. Google Scholar
Digital Library
- ]]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 Scholar
Digital Library
- ]]S. Abiteboul, B. Marinoiu, and P. Bourhis. Distributed Monitoring of Peer to Peer Systems (demo). In ICDE, 2008. Google Scholar
Digital Library
- ]]S. Abiteboul, L. Segoufin, and V. Vianu. Representing and querying xml with incomplete information. ACM Trans. Database Syst., 31(1):208--254, 2006. Google Scholar
Digital Library
- ]]S. Abiteboul, L. Segoufin, and V. Vianu. Static analysis of Active XML systems. In PODS, pages 221--230, 2008. Google Scholar
Digital Library
- ]]Active XML. http://activexml.net.Google Scholar
- ]]C. Beeri and R. Ramakrishnan. On the power of magic. J. Log. Program., 10(3-4):255--299, 1991. Google Scholar
Digital Library
- ]]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 Scholar
Digital Library
- ]]H. Björklund, W. Martens, and T. Schwentick. Conjunctive query containment over trees. In DBPL, pages 66--80, 2007. Google Scholar
Digital Library
- ]]H. Björklund, W. Martens, and T. Schwentick. Optimizing conjunctive queries over trees using schema information. In MFCS, pages 132--143, 2008. Google Scholar
Digital Library
- ]]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 Scholar
Digital Library
- ]]J. A. Blakeley, P.-A. Larson, and F. W. Tompa. Efficiently updating materialized views. SIGMOD Rec., 15(2):61--71, 1986. Google Scholar
Digital Library
- ]]A. Calì and D. Martinenghi. Querying data under access limitations. In ICDE, pages 50--59, 2008. Google Scholar
Digital Library
- ]]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 Scholar
- ]]C. David. Complexity of data tree patterns over xml documents. In MFCS, 2008. Google Scholar
Digital Library
- ]]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 Scholar
- ]]DTD. http://www.w3.org/tr/rec-xml/#dt-doctype.Google Scholar
- ]]R. Ennals and D. Gay. User-friendly functional programming for Web mashups. In ICFP, pages 223--234, 2007. Google Scholar
Digital Library
- ]]A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63--92, Apr. 2001. Google Scholar
Digital Library
- ]]B. Genest, A. Muscholl, O. Serre, and M. Zeitoun. Tree pattern rewriting systems. In ATVA, pages 332--346, 2008. Google Scholar
Digital Library
- ]]G. Gottlob and C. Koch. Monadic queries over tree-structured data. In LICS, pages 189--202, 2002. Google Scholar
Digital Library
- ]]G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. ACM Trans. Database Syst., 30(2):444--491, 2005. Google Scholar
Digital Library
- ]]G. Grahne. Problem of Incomplete Information in Relational Databases. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1991. Google Scholar
Digital Library
- ]]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 Scholar
Digital Library
- ]]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 Scholar
- ]]P. C. Kanellakis, G. M. Kuper, and P. Z. Revesz. Constraint query languages. J. Comput. Syst. Sci., 51(1):26--52, 1995. Google Scholar
Digital Library
- ]]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 Scholar
Digital Library
- ]]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 Scholar
Digital Library
- ]]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 Scholar
Digital Library
- ]]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 Scholar
- ]]G. Miklau and D. Suciu. Containment and equivalence for a fragment of XPath. J. ACM, 51(1):2--45, 2004. Google Scholar
Digital Library
- ]]A. Muscholl, T. Schwentick, and L. Segoufin. Active context-free games. In STACS, pages 452--464, 2004.Google Scholar
Cross Ref
- ]]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 Scholar
Digital Library
- ]]What Is Web 2.0. http://www.oreilly.com/.Google Scholar
- ]]WSDL. http://www.w3.org/tr/wsdl.Google Scholar
Index Terms
Satisfiability and relevance for queries over active documents
Recommendations
Promoting Document Relevance Using Query Term Proximity for Exploratory Search
In the information retrieval system, relevance manifestation is pivotal and regularly based on document-term statistics, i.e., term frequency (tf), inverse document frequency (idf), etc. Query term proximity (QTP) within matched documents is mostly ...
Enabling Structured Queries over Unstructured Documents
MDM '11: Proceedings of the 2011 IEEE 12th International Conference on Mobile Data Management - Volume 02With the information explosion on the internet, finding precise answers efficiently is a prevalent requirement by many users. Today, search engines answer keyword queries with a ranked list of documents. Users might not be always willing to read the top ...
Is relevance hard work?: evaluating the effort of making relevant assessments
SIGIR '13: Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrievalThe judging of relevance has been a subject of study in information retrieval for a long time, especially in the creation of relevance judgments for test collections. While the criteria by which assessors? judge relevance has been intensively studied, ...






Comments