Sciweavers

3368 search results - page 439 / 674
» The Complexity of Query Reliability
Sort
View
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
EDBT
2006
ACM
150views Database» more  EDBT 2006»
16 years 6 months ago
Improving the Efficiency of XPath Execution on Relational Systems
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
Haris Georgiadis, Vasilis Vassalos
EDBT
2008
ACM
141views Database» more  EDBT 2008»
16 years 6 months ago
Generating Highly Customizable SQL Parsers
Database technology and the Structured Query Language (SQL) have grown enormously in recent years. Applications from different domains have different requirements for using databa...
Gunter Saake, Marko Rosenmüller, Martin Kuhle...
DCC
2004
IEEE
16 years 6 months ago
Online Suffix Trees with Counts
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...
Breanndán Ó Nualláin, Steven ...
CBMS
2009
IEEE
16 years 1 months ago
Ontology driven data integration for autism research
Autism Spectrum Disorder is an inherently complex phenomenon requiring large studies of many different types to further understanding of its causes. The National Database for Auti...
Lynn Young, Samson W. Tu, Lakshika Tennakoon, Davi...