Sciweavers

503 search results - page 62 / 101
» The O2 Database Programming Language
Sort
View
TOOLS
1999
IEEE
14 years 1 months ago
Class Algebra for Ontology Reasoning
Class algebra provides a natural framework for sharing of ISA hierarchies between users that may be unaware of each other's definitions. This permits data from relational dat...
Daniel J. Buehrer, Chee-Hwa Lee
ICDT
1997
ACM
90views Database» more  ICDT 1997»
14 years 27 days ago
Adding Structure to Unstructured Data
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be mu...
Peter Buneman, Susan B. Davidson, Mary F. Fernande...
ICDT
2012
ACM
242views Database» more  ICDT 2012»
11 years 11 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
PADL
2009
Springer
14 years 9 months ago
Using Bloom Filters for Large Scale Gene Sequence Analysis in Haskell
Analysis of biological data often involves large data sets and computationally expensive algorithms. Databases of biological data continue to grow, leading to an increasing demand ...
Ketil Malde, Bryan O'Sullivan
ASPLOS
2006
ACM
14 years 2 months ago
Automatic generation of peephole superoptimizers
Peephole optimizers are typically constructed using human-written pattern matching rules, an approach that requires expertise and time, as well as being less than systematic at ex...
Sorav Bansal, Alex Aiken