publication . Research . Part of book or chapter of book . 2005

Main Memory Implementations for Binary Grouping

Norman May; Guido Moerkotte;
Open Access English
  • Published: 01 Jan 2005
  • Country: Germany
Abstract
An increasing number of applications depend on efficient storage and analysis features for XML data. Hence, query optimization and efficient evaluation techniques for the emerging XQuery standard become more and more important. Many XQuery queries require nested expressions. Unnesting them often introduces binary grouping. We introduce several algorithms implementing binary grouping and analyze their time and space complexity. Experiments demonstrate their performance.
Persistent Identifiers
Subjects
free text keywords: 004 Informatik, Data mining, computer.software_genre, computer, XQuery, computer.programming_language, Query optimization, Binary number, Hash table, Theoretical computer science, Time complexity, Binary search tree, Expression (mathematics), Computer science, XML, computer.internet_protocol
Related Organizations
Download fromView all 2 versions
https://ub-madoc.bib.uni-mannh...
Part of book or chapter of book
Provider: UnpayWall
http://www.springerlink.com/in...
Part of book or chapter of book . 2010
Provider: Crossref
Any information missing or wrong?Report an Issue