This HTML5 document contains 226 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dbpedia-dehttp://de.dbpedia.org/resource/
dbpedia-shhttp://sh.dbpedia.org/resource/
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
n28http://dbpedia.org/resource/PL/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbpedia-eohttp://eo.dbpedia.org/resource/
n21https://global.dbpedia.org/id/
n26http://www.gotw.ca/publications/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
dbpedia-ruhttp://ru.dbpedia.org/resource/
dbpedia-ukhttp://uk.dbpedia.org/resource/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n29http://c-faq.com/misc/
dbpedia-srhttp://sr.dbpedia.org/resource/
dbpedia-pthttp://pt.dbpedia.org/resource/
n14https://developer.apple.com/library/mac/%23documentation/CoreFoundation/Reference/CFBitVectorRef/Reference/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n15https://developer.apple.com/library/mac/%23documentation/CoreFoundation/Reference/CFMutableBitVectorRef/Reference/reference.html%23/apple_ref/doc/uid/
owlhttp://www.w3.org/2002/07/owl#
n25http://www-cs-faculty.stanford.edu/~knuth/
n23http://tl.dbpedia.org/resource/
dbpedia-zhhttp://zh.dbpedia.org/resource/
dbpedia-frhttp://fr.dbpedia.org/resource/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Processor_register
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Enumerated_type
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:List_of_data_structures
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Binary_search_algorithm
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Bit_manipulation
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Bitwise_operation
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Bloom_filter
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:ReiserFS
dbo:wikiPageWikiLink
dbr:Bit_array
dbp:fileStruct
dbr:Bit_array
Subject Item
dbr:Van_Emde_Boas_tree
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Indian_buffet_process
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Cryptographic_hash_function
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Shift_register
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Genetic_algorithm
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Bitmap_(disambiguation)
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Bitstring
dbo:wikiPageWikiLink
dbr:Bit_array
dbo:wikiPageRedirects
dbr:Bit_array
Subject Item
dbr:Crossover_(genetic_algorithm)
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Array
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Array_(data_structure)
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Hamming_weight
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:String_(computer_science)
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Bzip2
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Data-flow_analysis
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Database_index
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Logical_matrix
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:3SUM
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:ExFAT
dbo:wikiPageWikiLink
dbr:Bit_array
dbp:fileStruct
dbr:Bit_array
Subject Item
dbr:Find_first_set
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Binary_vector
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Directory-based_coherence
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Logical_connective
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Proteus_(programming_language)
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:HFS_Plus
dbo:wikiPageWikiLink
dbr:Bit_array
dbp:fileStruct
dbr:Bit_array
Subject Item
dbr:Hash_table
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:TI-68
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Binary_Independence_Model
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Binary_data
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Bit
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Bit_array
rdf:type
yago:PsychologicalFeature100023100 yago:Group100031264 yago:DataStructure105728493 yago:WikicatArrays yago:Array107939382 yago:Arrangement105726596 yago:Arrangement107938773 yago:WikicatBitDataStructures yago:Abstraction100002137 yago:WikicatDataStructures dbo:Building yago:Structure105726345 yago:Cognition100023271
rdfs:label
Бітова мапа Битовая карта Bit array Tableau de bits Bit array 位数组 Bitkette Bitĉeno
rdfs:comment
In der Informatik ist eine Bitkette (auch Bitstring oder je nach Dimension Bitvektor bzw. Bitarray) eine (endliche) Folge von Zeichen aus dem kleinsten interessanten Alphabet Σ; dieses besteht aus zwei Zeichen, den Bits: Σ := {0,1}. Während das Bitfeld vollständig in den Datentyp einer Binärzahl eingebettet ist und das einzelne Bit nur über sein programmiersprachliches Symbol anzusprechen ist, kommt beim Bitarray ein ganzzahliger Bit-Index (oder auch mehrere) hinzu. Bitkette und (1-dimensionaler) Bitvektor sind beim Zugriff auf ein einzelnes Bit konzeptionell ähnlich. 位数组(英語:bit array),是一种能够紧凑地存储位的数组。位数组可以被用来实现简单的集合。它能够通过硬件中位级别的并行运算快速操作。通常情况下,一个位数组可以存储位信息(w是硬件中单个存储单元的位数,如字节或字,而k是一非负整数),如果w不能被计算机中存储单位的字节数整除,就会由于浪费一些内存空间。 Бітова карта (англ. bitmap, bitset, bit array) — набір послідовно записаних двійкових розрядів, тобто послідовність (масив) бітів. Un tableau de bits (en anglais bitmap) est une structure de données, en particulier un tableau de données binaires. Il s'agit d'une collection ordonnée de bits assimilables à des booléens. Bitĉeno estas kompakte pakita vico da bitoj. La laŭbitaj operacioj de C traktas entjerojn kiel bitĉenojn. En Paskalo la bitĉenoj estas uzataj kiel maniero prezenti arojn kaj la samajn laŭbitajn buleajn operaciojn (kunaĵo, komunaĵo, simetria diferenco). Би́товая ка́рта (англ. bitmap, bitset, bit array) — набор последовательно записанных двоичных разрядов, то есть последовательность (массив) битов. Um bit array, ou arranjo de bit (também conhecido como bitmap, bitset, bit string ou bit vector) é um arranjo que armazena bits compactadamente, podendo ser usado para implementar um simples conjunto. O bit array é efetivo ao explorar paralelismo à "nível bit" em um hardware para executar operações rapidamente. Um típico arranjo armazena kw bits, onde w é o número de bits n unidade de armazenamento, como um byte ou palavra e k é algum inteiro não negativo. Se w não divide o número de bits a ser armazenados algum espaço é desperdiçado devido a fragmentação. A bit array (also known as bitmask, bit map, bit set, bit string, or bit vector) is an array data structure that compactly stores bits. It can be used to implement a simple set data structure. A bit array is effective at exploiting bit-level parallelism in hardware to perform operations quickly. A typical bit array stores kw bits, where w is the number of bits in the unit of storage, such as a byte or word, and k is some nonnegative integer. If w does not divide the number of bits to be stored, some space is wasted due to internal fragmentation.
dcterms:subject
dbc:Bit_data_structures dbc:Arrays
dbo:wikiPageID
1189937
dbo:wikiPageRevisionID
1122710440
dbo:wikiPageWikiLink
dbr:Posting_list dbr:Intersection_(set_theory) dbc:Bit_data_structures dbr:D_programming_language dbr:Arithmetic_logic_unit dbr:Priority_queue dbr:Data_compression dbr:SystemVerilog dbr:Complement_(set_theory) dbr:Information_retrieval dbr:Bit_field dbr:Core_Foundation dbr:Color_depth dbr:Byte dbr:Endianness dbr:Mask_(computing) dbr:Hamming_weight dbr:Verilog dbr:Standard_ML dbr:String_(computer_science) dbr:Word_(computer_architecture) dbr:Finite_field dbr:Page_(computing) dbr:Bloom_filter dbr:Flip-flop_(electronics) dbr:Bitwise_negation dbr:Unary_coding dbr:Bitmap_index dbr:Bit-level_parallelism dbr:Boost_C++_Libraries dbr:Data_cache dbr:Fragmentation_(computing) dbr:Golomb_coding dbr:Huffman_coding dbr:Find_first_set dbr:Trie dbr:Bit dbr:Judy_array dbr:Set_data_structure dbr:Linux_kernel dbr:Binary_numeral_system n28:pgSQL dbr:Enumerated_type dbr:Haskell_(programming_language) dbr:APL_(programming_language) n28:I dbr:Hash_table dbr:Raster_graphics dbr:Perl dbr:Proxy_pattern dbr:OpenVera dbr:E_(verification_language) dbr:Lexicographical_order dbc:Arrays dbr:Signed_number_representations dbr:Standard_Template_Library dbr:Common_Lisp dbr:VHDL dbr:Run-length_encoding dbr:Array_data_structure dbr:Succinct_data_structure dbr:C_(programming_language) dbr:Binary_code dbr:Bitstream dbr:.NET_Framework dbr:Array_programming dbr:Inode dbr:C++ dbr:GF(2) dbr:Bitwise_operation dbr:Union_(set_theory) dbr:Bitboard dbr:Partial_template_specialization dbr:X11 dbr:Ruby_(programming_language) dbr:Locality_of_reference dbr:Java_(programming_language)
dbo:wikiPageExternalLink
n14:reference.html n15:20001500 n25:fasc1a.ps.gz n26:N1185.pdf n26:N1211.pdf n29:bitsets.html
owl:sameAs
dbpedia-ru:Битовая_карта yago-res:Bit_array dbpedia-de:Bitkette dbpedia-sr:Bitski_niz dbpedia-uk:Бітова_мапа n21:uc1Z freebase:m.04fwd6 n23:Bit_array dbpedia-sh:Bitski_niz wikidata:Q1992074 dbpedia-fa:آرایه_بیتی dbpedia-zh:位数组 dbpedia-eo:Bitĉeno dbpedia-fr:Tableau_de_bits dbpedia-pt:Bit_array
dbp:wikiPageUsesTemplate
dbt:Math dbt:Reflist dbt:More_citations_needed dbt:Short_description dbt:Data_structures
dbo:abstract
A bit array (also known as bitmask, bit map, bit set, bit string, or bit vector) is an array data structure that compactly stores bits. It can be used to implement a simple set data structure. A bit array is effective at exploiting bit-level parallelism in hardware to perform operations quickly. A typical bit array stores kw bits, where w is the number of bits in the unit of storage, such as a byte or word, and k is some nonnegative integer. If w does not divide the number of bits to be stored, some space is wasted due to internal fragmentation. Um bit array, ou arranjo de bit (também conhecido como bitmap, bitset, bit string ou bit vector) é um arranjo que armazena bits compactadamente, podendo ser usado para implementar um simples conjunto. O bit array é efetivo ao explorar paralelismo à "nível bit" em um hardware para executar operações rapidamente. Um típico arranjo armazena kw bits, onde w é o número de bits n unidade de armazenamento, como um byte ou palavra e k é algum inteiro não negativo. Se w não divide o número de bits a ser armazenados algum espaço é desperdiçado devido a fragmentação. Bitĉeno estas kompakte pakita vico da bitoj. La laŭbitaj operacioj de C traktas entjerojn kiel bitĉenojn. En Paskalo la bitĉenoj estas uzataj kiel maniero prezenti arojn kaj la samajn laŭbitajn buleajn operaciojn (kunaĵo, komunaĵo, simetria diferenco). Бітова карта (англ. bitmap, bitset, bit array) — набір послідовно записаних двійкових розрядів, тобто послідовність (масив) бітів. Би́товая ка́рта (англ. bitmap, bitset, bit array) — набор последовательно записанных двоичных разрядов, то есть последовательность (массив) битов. In der Informatik ist eine Bitkette (auch Bitstring oder je nach Dimension Bitvektor bzw. Bitarray) eine (endliche) Folge von Zeichen aus dem kleinsten interessanten Alphabet Σ; dieses besteht aus zwei Zeichen, den Bits: Σ := {0,1}. Während das Bitfeld vollständig in den Datentyp einer Binärzahl eingebettet ist und das einzelne Bit nur über sein programmiersprachliches Symbol anzusprechen ist, kommt beim Bitarray ein ganzzahliger Bit-Index (oder auch mehrere) hinzu. Bitkette und (1-dimensionaler) Bitvektor sind beim Zugriff auf ein einzelnes Bit konzeptionell ähnlich. Obwohl die Sequenz von Binärziffern eines Bitvektors zur Bildung einer Binärzahl (beliebiger Größe) verwendet werden kann, hat ein Bitvektor zunächst nicht unmittelbar etwas mit einer Binärzahl zu tun – diese muss durch eine extra dafür vorgesehene Funktion gebildet werden. Eine klassische Anwendung eines Bitvektors ist das Sieb des Eratosthenes zur Bestimmung von Primzahlen. Un tableau de bits (en anglais bitmap) est une structure de données, en particulier un tableau de données binaires. Il s'agit d'une collection ordonnée de bits assimilables à des booléens. 位数组(英語:bit array),是一种能够紧凑地存储位的数组。位数组可以被用来实现简单的集合。它能够通过硬件中位级别的并行运算快速操作。通常情况下,一个位数组可以存储位信息(w是硬件中单个存储单元的位数,如字节或字,而k是一非负整数),如果w不能被计算机中存储单位的字节数整除,就会由于浪费一些内存空间。
gold:hypernym
dbr:Structure
prov:wasDerivedFrom
wikipedia-en:Bit_array?oldid=1122710440&ns=0
dbo:wikiPageLength
20820
foaf:isPrimaryTopicOf
wikipedia-en:Bit_array
Subject Item
dbr:Bit_field
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Bitboard
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Bitmap
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Bitmap_index
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Bitwise_trie_with_bitmap
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Black_box_group
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Hidden_linear_function_problem
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Jaccard_index
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Java_virtual_machine
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:C--
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Polyhedral_combinatorics
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Solomonoff's_theory_of_inductive_inference
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Free-space_bitmap
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:IBM_SAN_Volume_Controller
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Klein_four-group
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Set_(abstract_data_type)
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Shuffle-exchange_network
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Ugly_duckling_theorem
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Text_mode
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Task_state_segment
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Semantic_folding
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Parallel_breadth-first_search
dbo:wikiPageWikiLink
dbr:Bit_array
Subject Item
dbr:Boolean_array
dbo:wikiPageWikiLink
dbr:Bit_array
dbo:wikiPageRedirects
dbr:Bit_array
Subject Item
dbr:Boolean_vector
dbo:wikiPageWikiLink
dbr:Bit_array
dbo:wikiPageRedirects
dbr:Bit_array
Subject Item
dbr:Bitset
dbo:wikiPageWikiLink
dbr:Bit_array
dbo:wikiPageRedirects
dbr:Bit_array
Subject Item
dbr:Bitvector
dbo:wikiPageWikiLink
dbr:Bit_array
dbo:wikiPageRedirects
dbr:Bit_array
Subject Item
dbr:Bit_string
dbo:wikiPageWikiLink
dbr:Bit_array
dbo:wikiPageRedirects
dbr:Bit_array
Subject Item
dbr:Bit_vector
dbo:wikiPageWikiLink
dbr:Bit_array
dbo:wikiPageRedirects
dbr:Bit_array
Subject Item
dbr:Bit_vectors
dbo:wikiPageWikiLink
dbr:Bit_array
dbo:wikiPageRedirects
dbr:Bit_array
Subject Item
wikipedia-en:Bit_array
foaf:primaryTopic
dbr:Bit_array