Sciweavers

1078 search results - page 188 / 216
» DB
Sort
View
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
14 years 8 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
2005
ACM
138views Database» more  SIGMOD 2005»
14 years 8 months ago
QPipe: A Simultaneously Pipelined Relational Query Engine
Relational DBMS typically execute concurrent queries independently by invoking a set of operator instances for each query. To exploit common data retrievals and computation in con...
Stavros Harizopoulos, Vladislav Shkapenyuk, Anasta...
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 8 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
EDBT
2008
ACM
206views Database» more  EDBT 2008»
14 years 8 months ago
Designing an inductive data stream management system: the stream mill experience
There has been much recent interest in on-line data mining. Existing mining algorithms designed for stored data are either not applicable or not effective on data streams, where r...
Hetal Thakkar, Barzan Mozafari, Carlo Zaniolo
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 8 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...