Sciweavers

953 search results - page 13 / 191
» Efficient Evaluation of Large Polynomials
Sort
View
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
14 years 9 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
JSW
2007
126views more  JSW 2007»
13 years 7 months ago
Efficient Evaluation of Multiple-Output Boolean Functions in Embedded Software or Firmware
— The paper addresses software and firmware implementation of multiple-output Boolean functions based on cascades of Look-Up Tables (LUTs). A LUT cascade is described as a means ...
Vaclav Dvorak
ECBS
2007
IEEE
122views Hardware» more  ECBS 2007»
14 years 2 months ago
Time- and Space-Efficient Evaluation of Sparse Boolean Functions in Embedded Software
The paper addresses software implementation of large sparse systems of Boolean functions. Fast evaluation of such functions with the smallest memory consumption is often required ...
Vaclav Dvorak
ADBIS
2006
Springer
139views Database» more  ADBIS 2006»
13 years 11 months ago
Xeek: An Efficient Method for Supporting XPath Evaluation with Relational Databases
We introduce Xeek, a method for managing XML documents using relational databases. Most previous proposals in which the XPath axes are evaluated using only the pre- and postorder n...
Olli Luoma
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
13 years 11 months ago
An Efficient Index Lattice for XML Query Evaluation
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
Wilfred Ng, James Cheng