Package org.aksw.sparqlify.database

Interface Summary

Interface	Description
Constraint
Index<T>
MetaIndexFactory
Table<T>	A table itself only provides metadata.

Class Summary

Class	Description
AbstractIndex
Clause	A clause with restrictions derived for the variables
ClauseBase	Dnf, Clauses, and Exprs should be treated as immutable!
Cnf
Column
CompareConstraint
Dnf
EqualsConstraint
ExprIndex	TODO Clarify: Do I want disjunctive or conjunctive normal form? (a and b) or (c and d) or (a or b) and(c or d) ? I guess the former is better, as (a and not a) can be easily detected What happens if we allow conjunctions of disjunctive normal forms? ((a, b) or (c, d) AND ((x) or (y))) becomes (abx or aby or cdx or cdy) (so the cross product of the involved clauses) Maybe i could do virtual clauses: CrossJoinClause(Clauses ...) Hm, but with CNF it is easier to add new expressions.
ExprNormalForm
FilterPlacementOptimizer2
FilterSplit
IndexCollection<T>
IndexMetaNode	Datastructure for metadata about indexes (hierarchical and non-hierarchical).
IndirectEquiMap<K,V>
IsPrefixOfConstraint
NestedNormalForm
NestedSet<T>	IMPORTANT: If you are working with a child set, then do not modify the parent, or things might go out of sync.
OpExtFilterIndexed
OpFilterIndexed
PatriciaAccessorFactory
PatriciaPrefixMapStoreAccessor
PrefixIndex<T>
PrefixIndexMetaFactory
PrefixMapStoreAccessor	Accessor for a NavigableMap, Object> We separate the accessor from the store, in order to avoid duplicating (referenences to) the index metadata at each node of the index tree - this way there is just one accessor with the metadata, which can work on any corresponding store at some level in an hierarchical index.
RdfViewSystem2
StartsWithConstraint
TableBuilder<T>
TableImpl<T>
TreeIndex
VariableConstraint	Constraint for a variable.