BenchmarX'10 is scheduled on April 4, 2010. It will consist of three parts - an invited talk given by dr. Jiaheng Lu on Benchmarking Holistic Approaches to XML Tree Pattern Query Processing (the abstract can be found below) and two sessions consisting of accepted papers (see the list of abstracts of Accepted Papers). The program schedule of the DASFAA conference can be found here.

Start	End	Content
9:00	10:30	Session 1: (chair: Radim Baca, Technical University of Ostrava, Czech Republic) Invited Talk: Benchmarking Holistic Approaches to XML Tree Pattern Query Processing Jiaheng Lu (Renmin University of China)
10:30	10:45	Break
10:45	12:15	Session 2: (chair: Irena Mlynkova, Charles University in Prague, Czech Republic) Benchmarking the Compression of XML Node Streams Radim Baca (Technical University of Ostrava, Czech Republic) Jiri Walder (Technical University of Ostrava, Czech Republic) Martin Pawlas (Technical University of Ostrava, Czech Republic) Michal Kratky (Technical University of Ostrava, Czech Republic) Generation of Synthetic XML for Evaluation of Hybrid XML Systems David Hall (Linkopings universitet, Sweden) Lena Stromback (Linkopings universitet, Sweden) Benchmarking Publish/Subscribe-based Messaging Systems Kai Sachs (Databases and Distributed System Group, TU Darmstadt, Germany) Stefan Appel (Databases and Distributed System Group, TU Darmstadt, Germany) Samuel Kounev (Descartes Research Group, Karlsruhe Institute of Technology, Germany) Alejandro Buchmann (Databases and Distributed System Group, TU Darmstadt, Germany)
12:15	13:15	Lunch break
13:15	14:15	Session 3: (chair: Radim Baca, Technical University of Ostrava, Czech Republic) An Experimental Evaluation of Relational RDF Storage and Querying Techniques Hooran MahmoudiNasab (Macquarie University, Sydney, Australia) Sherif Sakr (University of New South Wales, Sydney, Australia) Analyzer: A Framework for File Analysis Martin Svoboda (Charles University in Prague, Czech Republic) Jakub Starka (Charles University in Prague, Czech Republic) Jan Sochna (Charles University in Prague, Czech Republic) Jiri Schejbal (Charles University in Prague, Czech Republic) Irena Mlynkova (Charles University in Prague, Czech Republic)
14:15	14:20	End of BenchmarX'10

Jiaheng Lu received his PhD degree in Computer Science at National University of Singapore (NUS) under the supervision of Prof. Ling Tok Wang. He did his postdoc research with Prof. Chen Li at the Department of Computer Science, University of California, Irvine. Currently he works as an Associate Professor at the Department of Computer Science of the Renmin University of China. His research interests are in the fields of database and information systems, including XML query processing, data mining, XML keyword suggestion, approximate string matching and cloud data management.

In this talk I will outline and survey some developments in the field of XML tree pattern query processing, especially focussing on holistic approaches. XML tree pattern query (TPQ) processing is a research stream within XML data management that focuses on efficient TPQ answering. With the increasing popularity of XML for data representation, there is a lot of interest in query processing over data that conforms to a tree-structured data model. Queries on XML data are commonly expressed in the form of tree patterns (or twig patterns), which represent a very useful subset of XPath and XQuery. Efficiently finding all tree pattern matches in an XML database is a major concern of XML query processing. In the past few years, many algorithms have been proposed to match such tree patterns. In the talk, I will present an overview of the state of the art in TPQ processing. This overview shall start by providing some background in holistic approaches to process TPQ and then introduce different algorithms and finally present benchmark datasets and experiments.