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

Attributes

Ordered Tree Type
<p>An "Ordered Tree Type" is a data type that defines the properties of data structures that represent ordered trees. An ordered tree is a tree where the children of every node are ordered, that is, there is a first child, second child, third child, etc. Typically a type specification for an ordered tree will include the comparison operator (such as <b>lt</b> or <b>gt</b>) that is used to order the nodes. </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
Ordered Collection Type
SELECT ?subclass ?description WHERE { ?subclass rdfs:subClassOf ?? . OPTIONAL { ?subclass (rdfs:comment|schema:description) ?description . } } LIMIT 5000

Subclasses of this Class

subclass description
Heap