SELECT ?property ?value WHERE { BIND (?? AS ?s) ?s ?property ?value . FILTER (isLiteral(?value)) } LIMIT 1000

Attributes

Balanced Tree Type
<p>A Balanced Tree Type is a data type that defines the properties of data structures that represent balanced trees. A balanced tree is a tree where no leaf is much farther away from the root than any other leaf. Different balancing schemes allow different definitions of "much farther" and different amounts of work to keep them balanced. </p>
SELECT ?property ?object WHERE { BIND (?? AS ?s) ?s ?property ?object . FILTER (isIRI(?object)) FILTER (?property != rdf:type) FILTER (?property != rdfs:subClassOf) } LIMIT 1000

Outgoing Relationships

property object
isDefinedBy QUDT SCHEMA - Datatypes
SELECT ?property ?subject WHERE { BIND (?? AS ?o) ?subject ?property ?o . FILTER (?property != rdf:type) FILTER (?property != rdfs:subClassOf) } LIMIT 1000
Incoming Relationships: No results found.
SELECT ?instance ?description WHERE { BIND (?? AS ?class) ?instance (rdf:type|owl:type) ?class . OPTIONAL { ?instance schema:description ?description . } } LIMIT 5000
Instances of this Class: No results found.
SELECT ?superclass ?description WHERE { ?? rdfs:subClassOf ?superclass . OPTIONAL { ?superclass (rdfs:comment|schema:description) ?description . } } LIMIT 5000

Superclasses of this Class

superclass description
Tree Type
genid-d126ca64a7114668976fd58faae8ce97-0b13_b5038
SELECT ?subclass ?description WHERE { ?subclass rdfs:subClassOf ?? . OPTIONAL { ?subclass (rdfs:comment|schema:description) ?description . } } LIMIT 5000
Subclasses of this Class: No results found.