Sciweavers

26 search results - page 2 / 6
» BLAS: An Efficient XPath Processing System
Sort
View
EDBT
2010
ACM
189views Database» more  EDBT 2010»
13 years 10 months ago
Efficient physical operators for cost-based XPath execution
The creation of a generic and modular query optimization and processing infrastructure can provide significant benefits to XML data management. Key pieces of such an infrastructur...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
COMAD
2008
13 years 6 months ago
Efficient Evaluation of Forward XPath Axes over XML Streams
Although many algorithms have been proposed for evaluating XPath queries containing un-ordered axes (child, descendant, parent and ancestor) against streaming XML data, there are ...
Abdul Nizar, P. Sreenivasa Kumar
HPCC
2007
Springer
13 years 8 months ago
Concurrent Number Cruncher: An Efficient Sparse Linear Solver on the GPU
A wide class of geometry processing and PDE resolution methods needs to solve a linear system, where the non-zero pattern of the matrix is dictated by the connectivity matrix of th...
Luc Buatois, Guillaume Caumon, Bruno Lévy
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
14 years 5 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
SIGMOD
2007
ACM
146views Database» more  SIGMOD 2007»
14 years 5 months ago
Distributed query evaluation with performance guarantees
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
Gao Cong, Wenfei Fan, Anastasios Kementsietsidis