U+25B7 WHITE RIGHT-POINTING TRIANGLE
U+25B7 was added to Unicode in version 1.1 (1993). It belongs to the block
This character is a Math Symbol and is commonly used, that is, in no specific script. The character is also known as z notation range restriction.
The glyph is not a composition. It has a Ambiguous East Asian Width. In bidirectional context it acts as Other Neutral and is not mirrored. The glyph can, under circumstances, be confused with 1 other glyphs. In text U+25B7 behaves as Ambiguous (Alphabetic or Ideographic) regarding line breaks. It has type Other for sentence and Other for word breaks. The Grapheme Cluster Break is Any.
The CLDR project labels this character “hollow right-pointing triangle” for use in screen reading software. It assigns additional tags, e.g. for search in emoji pickers: hollow right-pointing triangle.
The Wikipedia has the following information about this codepoint:
In database theory, relational algebra is a theory that uses algebraic structures with a well-founded semantics for modeling data, and defining queries on it. The theory was introduced by Edgar F. Codd.
The main application of relational algebra is to provide a theoretical foundation for relational databases, particularly query languages for such databases, chief among which is SQL. Relational databases store tabular data represented as relations. Queries over relational databases often likewise return tabular data represented as relations.
The main purpose of the relational algebra is to define operators that transform one or more input relations to an output relation. Given that these operators accept relations as input and produce relations as output, they can be combined and used to express potentially complex queries that transform potentially many input relations (whose data are stored in the database) into a single output relation (the query results).
Unary operators accept as input a single relation; examples include operators to filter certain attributes (columns) or tuples (rows) from an input relation.
Binary operators accept as input two relations; such operators combine the two input relations into a single output relation by, for example, taking all tuples found in either relation, removing tuples from the first relation found in the second relation, extending the tuples of the first relation with tuples in the second relation matching certain conditions, and so forth.
Other more advanced operators can also be included, where the inclusion or exclusion of certain operators gives rise to a family of algebras.
Representations
System | Representation |
---|---|
Nº | 9655 |
UTF-8 | E2 96 B7 |
UTF-16 | 25 B7 |
UTF-32 | 00 00 25 B7 |
URL-Quoted | %E2%96%B7 |
HTML-Escape | ▷ |
Wrong windows-1252 Mojibake | â· |
alias | z notation range restriction |
Encoding: EUC-KR (hex bytes) | A2 B9 |
AGL: Latin-4 | uni25B7 |
AGL: Latin-5 | uni25B7 |
Adobe Glyph List | whiterightpointingtriangle |
digraph | Tr |
Related Characters
Confusables
Elsewhere
Complete Record
Property | Value |
---|---|
1.1 (1993) | |
WHITE RIGHT-POINTING TRIANGLE | |
WHITE RIGHT POINTING TRIANGLE | |
Geometric Shapes | |
Math Symbol | |
Common | |
Other Neutral | |
Not Reordered | |
None | |
|
|
✘ | |
|
|
|
|
✘ | |
|
|
|
|
|
|
|
|
|
|
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
|
|
Any | |
✔ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
— | |
NA | |
Other | |
— | |
✘ | |
✘ | |
✔ | |
✘ | |
Yes | |
Yes | |
|
|
Yes | |
Yes | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✔ | |
✘ | |
✘ | |
✘ | |
✘ | |
Other | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
Other | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
✘ | |
|
|
None | |
Ambiguous | |
Not Applicable | |
— | |
No_Joining_Group | |
Non Joining | |
Ambiguous (Alphabetic or Ideographic) | |
None | |
not a number | |
|
|
U |