Sciweavers

5221 search results - page 301 / 1045
» An On-line Problem Database
Sort
View
VLDB
2002
ACM
106views Database» more  VLDB 2002»
15 years 6 months ago
Efficient Algorithms for Processing XPath Queries
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
Georg Gottlob, Christoph Koch, Reinhard Pichler
ER
2010
Springer
146views Database» more  ER 2010»
15 years 5 months ago
Data Modeling Is Important for SOA
The promise of SOA is being held back by a lack of rigor with XSD interchange files. Many developers focus on the design of individual services and pay little attention to how the ...
Michael R. Blaha
DATESO
2010
233views Database» more  DATESO 2010»
15 years 4 months ago
Efficient Implementation of XPath Processor on Multi-Core CPUs
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
Martin Krulis, Jakub Yaghob
DATESO
2010
132views Database» more  DATESO 2010»
15 years 4 months ago
Two-step Modified SOM for Parallel Calculation
This paper presents a simple modification of classic Kohonen network (SOM), which allows parallel processing of input data vectors or partitioning the problem in case of insufficie...
Petr Gajdos, Pavel Moravec
ICDE
2009
IEEE
186views Database» more  ICDE 2009»
16 years 8 months ago
A Benchmark for Online Index Selection
Online approaches to physical design tuning have received considerable attention in the recent literature, with a focus on the problem of online index selection. However, it is dif...
Karl Schnaitter, Neoklis Polyzotis