Today user-centered information acquisition over collections of complex XML documents is increasingly in demand. To this end, preferences have become an important paradigm enabling users to express individual interests and delivering personalized information. As the structure of XML documents plays

Abstract. Today XML is an essential technology for knowledge management within enterprises and dissemination of data over the Web. Therefore the efficient evaluation of XML queries has been thoroughly researched. But given the ever growing amount of information available in different sources, also

. Evaluating selection queries against XML streams is especially challenging because XML data is structured (like records) and might have unbounded size. This paper proposes an efficient single-pass evaluator of XPath queries against XML data streams unbounded (possibly infinite) in size. The evaluator

in sensor networks [6], financial and tra#c monitoring, and routing of MPEG-7 [7] call for querying data streams. In many such applications, XML streams are arguably more appropriate than flat data streams, for XML data is recordlike, though not precluding multiple occurrences of fields with the same name

. Evaluating selection queries against XML streams is especially challenging because XML data is structured (like records) and might have unbounded size. This paper proposes an efficient single-pass evaluator of XPath queries against XML data streams unbounded (possibly infinite) in size. The evaluator

Abstract — Facing today’s information flood needs efficient means for personalization. Therefore XML query processing over large volumes of data needs to make the most out of already spent processing time by caching common (sub)expressions for reuse. This is especially promising for the new

Efficient query processing using XPath or XQuery has inspired a lot of research. In contrast to classical exact match retrieval, in today’s systems, specifying preferences rather than simple hard constraints is essential. As the structure of XML documents plays a major part in retrieval, recently

time to expeditiously provide ranked answers. Results of a preliminary user study demonstrate that our query relaxation and results ranking methods can capture the user’s preferences effectively. The efficiency and effectiveness of our approach is also demonstrated by experimental result.

to better comprehension, particularly when complex information was presented. Accuracy was similar for colour and black and white graphs. Practical implications -These results suggest that 2D graphs are preferable to 3D graphs, particularly when the task requires that the reader extract complex information

I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available