Sciweavers

188 search results - page 32 / 38
» Efficient Processing of Ordered XML Twig Pattern
Sort
View
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 12 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
IDEAS
2000
IEEE
90views Database» more  IDEAS 2000»
13 years 12 months ago
StreamJoin: A Generic Database Approach to Support the Class of Stream-Oriented Applications
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...
Clara Nippl, Ralf Rantzau, Bernhard Mitschang
IR
2006
13 years 7 months ago
Table extraction for answer retrieval
The ability to find tables and extract information from them is a necessary component of many information retrieval tasks. Documents often contain tables in order to communicate d...
Xing Wei, W. Bruce Croft, Andrew McCallum
DFT
2003
IEEE
64views VLSI» more  DFT 2003»
14 years 25 days ago
Hybrid BIST Time Minimization for Core-Based Systems with STUMPS Architecture
1 This paper presents a solution to the test time minimization problem for core-based systems that contain sequential cores with STUMPS architecture. We assume a hybrid BIST approa...
Gert Jervan, Petru Eles, Zebo Peng, Raimund Ubar, ...
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
13 years 11 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink