Sciweavers

471 search results - page 94 / 95
» Optimizing XPath Queries on Streaming XML Data
Sort
View
PODS
2003
ACM
158views Database» more  PODS 2003»
15 years 11 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
ICS
2009
Tsinghua U.
15 years 6 months ago
High-performance regular expression scanning on the Cell/B.E. processor
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
Daniele Paolo Scarpazza, Gregory F. Russell
BMCBI
2002
129views more  BMCBI 2002»
14 years 11 months ago
SeqHound: biological sequence and structure database as a platform for bioinformatics research
Background: SeqHound has been developed as an integrated biological sequence, taxonomy, annotation and 3-D structure database system. It provides a high-performance server platfor...
Katerina Michalickova, Gary D. Bader, Michel Dumon...
SIGMOD
2005
ACM
143views Database» more  SIGMOD 2005»
15 years 11 months ago
Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles
While traditional database systems optimize for performance on one-shot queries, emerging large-scale monitoring applications require continuous tracking of complex aggregates and...
Graham Cormode, Minos N. Garofalakis, S. Muthukris...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 5 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet