Incremental evaluation of a monotone XPath fragment

This paper shows a scheme for incremental evaluation of XPath queries. Here, we focus on a monotone fragment of XPath, i.e., when a data is deleted from (or inserted to) the database, only deletion (insertion, resp.) may occur to query answers. For efficiently processing deletions, we store information on partial matchings, i.e., which elements were participating in matchings for which query answers, and also store counters showing how many matchings each query answer had. We use the information on the partial matchings also for skipping a part of computation upon data insertion. We investigate properties of the XPath fragment in order to keep the amount of information we store as small as possible. Categories and Subject Descriptors: H.2.4 [Database Management]: System—Query processing General Terms: Algorithms, Performance

• Type: Conference
• Year: 2005
• Where: CIKM
• Authors: Hidetaka Matsumura, Keishi Tajima
• Keywords: CIKM 2005, Partial Matchings, Query Answer, XPATH Queries