text:
In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children. Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as databases and file systems.

History
B-trees were invented by Rudolf Bayer and Edward M. McCreight while working at Boeing Research Labs, for the purpose of efficiently managing index pages for large random-access files. The basic assumption was that indices would be so voluminous that only small chunks of the tree could fit in main memory. Bayer and McCreight's paper, Organization and maintenance of large ordered indices, was first circulated in July 1970 and later published in Acta Informatica.

Bayer and McCreight never explained what, if anything, the B stands for: Boeing, balanced, between, broad, bushy, and Bayer have been suggested. McCreight has said that "the more you think about what the B in B-trees means, the better you understand B-trees."

In 2011 Google developed the C++ B-Tree, reporting a 50-80% reduction in memory use for small data types and improved performance for large data sets when compared to a Red-Black tree.

Definition
According to Knuth's definition, a B-tree of order m is a tree which satisfies the following properties:

 Every node has at most m children.
 Every internal node has at least ⌈m/2⌉ children.
 Every non-leaf node has at least two children.
 All leaves appear on the same level.
 A non-leaf node with k children contains k−1 keys.

Each internal node's keys act as separation values which divide its subtrees. For example, if an internal node has 3 child nodes (or subtrees) then it must have 2 keys: a1 and a2. All values in the leftmost subtree will be less than a1, all values in the middle subtree will be between a1 and a2, and all values in the rightmost subtree will be greater than a2.

Internal nodes
 Internal nodes (also known as inner nodes) are all nodes except for leaf nodes and the root node. They are usually represented as an ordered set of elements and child pointers. Every internal node contains a maximum of U children and a minimum of L children. Thus, the number of elements is always 1 less than the number of child pointers (the number of elements is between L−1 and U−1). U must be either 2L or 2L−1; therefore each internal node is at least half full. The relationship between U and L implies that two half-full nodes can be joined to make a legal node, and one full node can be split into two legal nodes (if there's room to push one element up into the parent). These properties make it possible to delete and insert new values into a B-tree and adjust the tree to preserve the B-tree properties.
The root node
 The root node's number of children has the same upper limit as internal nodes, but has no lower limit. For example, when there are fewer than L−1 elements in the entire tree, the root will be the only node in the tree with no children at all.

Leaf nodes
 In Knuth's terminology, the "leaf" nodes are the actual data objects / chunks. The internal nodes that are one level above these leaves are what would be called the "leaves" by other authors: these nodes only store keys (at most m-1, and at least m/2-1 if they are not the root) and pointers (one for each key) to nodes carrying the data objects / chunks.

A B-tree of depth n+1 can hold about U times as many items as a B-tree of depth n, but the cost of search, insert, and delete operations grows with the depth of the tree. As with any balanced tree, the cost grows much more slowly than the number of elements.

Some balanced trees store values only at leaf nodes, and use different kinds of nodes for leaf nodes and internal nodes. B-trees keep values in every node in the tree except leaf nodes.

Differences in terminology
The literature on B-trees is not uniform in its terminology.

Bayer and McCreight (1972), Comer (1979), and others define the order of B-tree as the minimum number of keys in a non-root node.  Folk and Zoellick  points out that terminology is ambiguous because the maximum number of keys is not clear. An order 3 B-tree might hold a maximum of 6 keys or a maximum of 7 keys. Knuth (1998) avoids the problem by defining the order to be the maximum number of children (which is one more than the maximum number of keys).

The term leaf is also inconsistent. Bayer and McCreight (1972) considered the leaf level to be the lowest level of keys, but Knuth considered the leaf level to be one level below the lowest keys. There are many possible implementation choices. In some designs, the leaves may hold the entire data record; in other designs, the leaves may only hold pointers to the data record. Those choices are not fundamental to the idea of a B-tree.

For simplicity, most authors assume there are a fixed number of keys that fit in a node. The basic assumption is the key size is fixed and the node size is fixed. In practice, variable length keys may be employed.

Informal description

In B-trees, internal (non-leaf) nodes can have a variable number of child nodes within some pre-defined range. When data is inserted or removed from a node, its number of child nodes changes. In order to maintain the pre-defined range, internal nodes may be joined or split. Because a range of child nodes is permitted, B-trees do not need re-balancing as frequently as other self-balancing search trees, but may waste some space, since nodes are not entirely full. The lower and upper bounds on the number of child nodes are typically fixed for a particular implementation. For example, in a 2–3 tree (sometimes referred to as a 2–3 B-tree), each internal node may have only 2 or 3 child nodes.

Each internal node of a B-tree contains a number of keys. The keys act as separation values which divide its subtrees. For example, if an internal node has 3 child nodes (or subtrees) then it must have 2 keys:  and . All values in the leftmost subtree will be less than , all values in the middle subtree will be between  and , and all values in the rightmost subtree will be greater than .

Usually, the number of keys is chosen to vary between  and , where  is the minimum number of keys, and  is the minimum degree or branching factor of the tree. In practice, the keys take up the most space in a node. The factor of 2 will guarantee that nodes can be split or combined. If an internal node has  keys, then adding a key to that node can be accomplished by splitting the hypothetical  key node into two  key nodes and moving the key that would have been in the middle to the parent node. Each split node has the required minimum number of keys. Similarly, if an internal node and its neighbor each have  keys, then a key may be deleted from the internal node by combining it with its neighbor. Deleting the key would make the internal node have  keys; joining the neighbor would add  keys plus one more key brought down from the neighbor's parent. The result is an entirely full node of  keys.

The number of branches (or child nodes) from a node will be one more than the number of keys stored in the node. In a 2–3 B-tree, the internal nodes will store either one key (with two child nodes) or two keys (with three child nodes). A B-tree is sometimes described with the parameters — or simply with the highest branching order, .

A B-tree is kept balanced after insertion by splitting a would-be overfilled node, of  keys, into two -key siblings and inserting the mid-value key into the parent. Depth only increases when the root is split, maintaining balance. Similarly, a B-tree is kept balanced after deletion by merging or redistributing keys among siblings to maintain the -key minimum for non-root nodes. A merger reduces the number of keys in the parent potentially forcing it to merge or redistribute keys with its siblings, and so on. The only change in depth occurs when the root has two children, of  and (transitionally)  keys, in which case the two siblings and parent are merged, reducing the depth by one.

This depth will increase slowly as elements are added to the tree, but an increase in the overall depth is infrequent, and results in all leaf nodes being one more node farther away from the root.

B-trees have substantial advantages over alternative implementations when the time to access the data of a node greatly exceeds the time spent processing that data, because then the cost of accessing the node may be amortized over multiple operations within the node. This usually occurs when the node data are in secondary storage such as disk drives. By maximizing the number of keys within each internal node, the height of the tree decreases and the number of expensive node accesses is reduced. In addition, rebalancing of the tree occurs less often. The maximum number of child nodes depends on the information that must be stored for each child node and the size of a full disk block or an analogous size in secondary storage. While 2–3 B-trees are easier to explain, practical B-trees using secondary storage need a large number of child nodes to improve performance.

Variants
The term B-tree may refer to a specific design or it may refer to a general class of designs. In the narrow sense, a B-tree stores keys in its internal nodes but need not store those keys in the records at the leaves. The general class includes variations such as the B+ tree, the B* tree and the B*+ tree.
 In the B+ tree, copies of the keys are stored in the internal nodes; the keys and records are stored in leaves; in addition, a leaf node may include a pointer to the next leaf node to speed sequential access.
 The B* tree balances more neighboring internal nodes to keep the internal nodes more densely packed. This variant ensures non-root nodes are at least 2/3 full instead of 1/2. As the most costly part of operation of inserting the node in B-tree is splitting the node, B*-trees are created to postpone splitting operation as long as they can. To maintain this, instead of immediately splitting up a node when it gets full, its keys are shared with a node next to it. This spill operation is less costly to do than split, because it requires only shifting the keys between existing nodes, not allocating memory for a new one. For inserting, first it is checked whether the node has some free space in it, and if so, the new key is just inserted in the node. However, if the node is full (it has  keys, where  is the order of the tree as maximum number of pointers to subtrees from one node), it needs to be checked whether the right sibling exists and has some free space. If the right sibling has  keys, then keys are redistributed between the two sibling nodes as evenly as possible. For this purpose,  keys from the current node, the new key inserted, one key from the parent node and  keys from the sibling node are seen as an ordered array of  keys. The array becomes split by half, so that  lowest keys stay in the current node, the next (middle) key is inserted in the parent and the rest go to the right sibling. (The newly inserted key might end up in any of the three places.) The situation when right sibling is full, and left isn't is analogous. When both the sibling nodes are full, then the two nodes (current node and a sibling) are split into three and one more key is shifted up the tree, to the parent node. If the parent is full, then spill/split operation propagates towards the root node. Deleting nodes is somewhat more complex than inserting however.
 The B*+ tree combines the main B+ tree and B* tree features together.
 B-trees can be turned into order statistic trees to allow rapid searches for the Nth record in key order, or counting the number of records between any two records, and various other related operations.

B-tree usage in databases

Time to search a sorted file
Usually, sorting and searching algorithms have been characterized by the number of comparison operations that must be performed using order notation. A binary search of a sorted table with  records, for example, can be done in roughly  comparisons. If the table had 1,000,000 records, then a specific record could be located with at most 20 comparisons: .

Large databases have historically been kept on disk drives. The time to read a record on a disk drive far exceeds the time needed to compare keys once the record is available. The time to read a record from a disk drive involves a seek time and a rotational delay. The seek time may be 0 to 20 or more milliseconds, and the rotational delay averages about half the rotation period. For a 7200 RPM drive, the rotation period is 8.33 milliseconds. For a drive such as the Seagate ST3500320NS, the track-to-track seek time is 0.8 milliseconds and the average reading seek time is 8.5 milliseconds. For simplicity, assume reading from disk takes about 10 milliseconds.

Naively, then, the time to locate one record out of a million would take 20 disk reads times 10 milliseconds per disk read, which is 0.2 seconds.

The time won't be that bad because individual records are grouped together in a disk block. A disk block might be 16 kilobytes. If each record is 160 bytes, then 100 records could be stored in each block. The disk read time above was actually for an entire block. Once the disk head is in position, one or more disk blocks can be read with little delay. With 100 records per block, the last 6 or so comparisons don't need to do any disk reads—the comparisons are all within the last disk block read.

To speed the search further, the first 13 to 14 comparisons (which each required a disk access) must be sped up.

An index speeds the search
A B-tree index creates a multi-level tree structure that breaks a database down into fixed-size blocks or pages. Each level of this tree can be used to link those pages via an address location, allowing one page (known as a node, or internal page) to refer to another with leaf pages at the lowest level. One page is typically the starting point of the tree, or the "root". This is where the search for a particular key would begin, traversing a path that terminates in a leaf. Most pages in this structure will be leaf pages which ultimately refer to specific table rows.

A significant improvement in performance can be made with a B-tree index. Because each node (or internal page) can have more than two children, a B-tree index will usually have a shorter height (the distance from the root to the farthest leaf) than a Binary Search Tree. In the example above, initial disk reads narrowed the search range by a factor of two. That can be improved substantially by creating an auxiliary index that contains the first record in each disk block (sometimes called a sparse index). This auxiliary index would be 1% of the size of the original database, but it can be searched more quickly. Finding an entry in the auxiliary index would tell us which block to search in the main database; after searching the auxiliary index, we would have to search only that one block of the main database—at a cost of one more disk read. The index would hold 10,000 entries, so it would take at most 14 comparisons. Like the main database, the last six or so comparisons in the auxiliary index would be on the same disk block. The index could be searched in about eight disk reads, and the desired record could be accessed in 9 disk reads.

The trick of creating an auxiliary index can be repeated to make an auxiliary index to the auxiliary index. That would make an aux-aux index that would need only 100 entries and would fit in one disk block.

Instead of reading 14 disk blocks to find the desired record, we only need to read 3 blocks. This blocking is the core idea behind the creation of the B-tree, where the disk blocks fill-out a hierarchy of levels to make up the index. Reading and searching the first (and only) block of the aux-aux index which is the root of the tree identifies the relevant block in aux-index in the level below. Reading and searching that aux-index block identifies the relevant block to read, until the final level, known as the leaf level, identifies a record in the main database. Instead of 150 milliseconds, we need only 30 milliseconds to get the record.

The auxiliary indices have turned the search problem from a binary search requiring roughly  disk reads to one requiring only  disk reads where  is the blocking factor (the number of entries per block:  entries per block in our example;  reads).

In practice, if the main database is being frequently searched, the aux-aux index and much of the aux index may reside in a disk cache, so they would not incur a disk read. The B-tree remains the standard index implementation in almost all relational databases, and many nonrelational databases use them too.

Insertions and deletions
If the database does not change, then compiling the index is simple to do, and the index need never be changed. If there are changes, then managing the database and its index becomes more complicated.

Deleting records from a database is relatively easy. The index can stay the same, and the record can just be marked as deleted. The database remains in sorted order. If there are a large number of lazy deletions, then searching and storage become less efficient.

Insertions can be very slow in a sorted sequential file because room for the inserted record must be made. Inserting a record before the first record requires shifting all of the records down one. Such an operation is just too expensive to be practical. One solution is to leave some spaces. Instead of densely packing all the records in a block, the block can have some free space to allow for subsequent insertions. Those spaces would be marked as if they were "deleted" records.

Both insertions and deletions are fast as long as space is available on a block. If an insertion won't fit on the block, then some free space on some nearby block must be found and the auxiliary indices adjusted. The hope is that enough space is available nearby, such that a lot of blocks do not need to be reorganized. Alternatively, some out-of-sequence disk blocks may be used.

Advantages of B-tree usage for databases
The B-tree uses all of the ideas described above. In particular, a B-tree:
 keeps keys in sorted order for sequential traversing
 uses a hierarchical index to minimize the number of disk reads
 uses partially full blocks to speed up insertions and deletions
 keeps the index balanced with a recursive algorithm

In addition, a B-tree minimizes waste by making sure the interior nodes are at least half full. A B-tree can handle an arbitrary number of insertions and deletions.

Best case and worst case heights
Let  be the height of the classic B-tree (see  for the tree height definition). Let  be the number of entries in the tree. Let m be the maximum number of children a node can have. Each node can have at most  keys.

It can be shown (by induction for example) that a B-tree of height h with all its nodes completely filled has  entries. Hence, the best case height (i.e. the minimum height) of a B-tree is:

Let  be the minimum number of children an internal (non-root) node must have. For an ordinary B-tree,

Comer (1979) and Cormen et al. (2001) give the worst case height (the maximum height) of a B-tree as

Algorithms

Search
Searching is similar to searching a binary search tree. Starting at the root, the tree is recursively traversed from top to bottom. At each level, the search reduces its field of view to the child pointer (subtree) whose range includes the search value. A subtree's range is defined by the values, or keys, contained in its parent node. These limiting values are also known as separation values.

Binary search is typically (but not necessarily) used within nodes to find the separation values and child tree of interest.

Insertion

All insertions start at a leaf node. To insert a new element, search the tree to find the leaf node where the new element should be added. Insert the new element into that node with the following steps:

 If the node contains fewer than the maximum allowed number of elements, then there is room for the new element. Insert the new element in the node, keeping the node's elements ordered.
 Otherwise the node is full, evenly split it into two nodes so:
 A single median is chosen from among the leaf's elements and the new element that is being inserted.
 Values less than the median are put in the new left node and values greater than the median are put in the new right node, with the median acting as a separation value.
 The separation value is inserted in the node's parent, which may cause it to be split, and so on. If the node has no parent (i.e., the node was the root), create a new root above this node (increasing the height of the tree).

If the splitting goes all the way up to the root, it creates a new root with a single separator value and two children, which is why the lower bound on the size of internal nodes does not apply to the root. The maximum number of elements per node is U−1. When a node is split, one element moves to the parent, but one element is added. So, it must be possible to divide the maximum number U−1 of elements into two legal nodes. If this number is odd, then U=2L and one of the new nodes contains (U−2)/2 = L−1 elements, and hence is a legal node, and the other contains one more element, and hence it is legal too. If U−1 is even, then U=2L−1, so there are 2L−2 elements in the node. Half of this number is L−1, which is the minimum number of elements allowed per node.

An alternative algorithm supports a single pass down the tree from the root to the node where the insertion will take place, splitting any full nodes encountered on the way preemptively. This prevents the need to recall the parent nodes into memory, which may be expensive if the nodes are on secondary storage. However, to use this algorithm, we must be able to send one element to the parent and split the remaining U−2 elements into two legal nodes, without adding a new element. This requires U = 2L rather than U = 2L−1, which accounts for why some textbooks impose this requirement in defining B-trees.

Deletion
There are two popular strategies for deletion from a B-tree.

 Locate and delete the item, then restructure the tree to retain its invariants, OR
 Do a single pass down the tree, but before entering (visiting) a node, restructure the tree so that once the key to be deleted is encountered, it can be deleted without triggering the need for any further restructuring

The algorithm below uses the former strategy.

There are two special cases to consider when deleting an element:

 The element in an internal node is a separator for its child nodes
 Deleting an element may put its node under the minimum number of elements and children

The procedures for these cases are in order below.

Deletion from a leaf node
 Search for the value to delete.
 If the value is in a leaf node, simply delete it from the node.
 If underflow happens, rebalance the tree as described in section "Rebalancing after deletion" below.

Deletion from an internal node
Each element in an internal node acts as a separation value for two subtrees, therefore we need to find a replacement for separation. Note that the largest element in the left subtree is still less than the separator. Likewise, the smallest element in the right subtree is still greater than the separator. Both of those elements are in leaf nodes, and either one can be the new separator for the two subtrees. Algorithmically described below:

 Choose a new separator (either the largest element in the left subtree or the smallest element in the right subtree), remove it from the leaf node it is in, and replace the element to be deleted with the new separator.
 The previous step deleted an element (the new separator) from a leaf node. If that leaf node is now deficient (has fewer than the required number of nodes), then rebalance the tree starting from the leaf node.

Rebalancing after deletion
Rebalancing starts from a leaf and proceeds toward the root until the tree is balanced. If deleting an element from a node has brought it under the minimum size, then some elements must be redistributed to bring all nodes up to the minimum. Usually, the redistribution involves moving an element from a sibling node that has more than the minimum number of nodes. That redistribution operation is called a rotation. If no sibling can spare an element, then the deficient node must be merged with a sibling. The merge causes the parent to lose a separator element, so the parent may become deficient and need rebalancing. The merging and rebalancing may continue all the way to the root. Since the minimum element count doesn't apply to the root, making the root be the only deficient node is not a problem. The algorithm to rebalance the tree is as follows:
 If the deficient node's right sibling exists and has more than the minimum number of elements, then rotate left
 Copy the separator from the parent to the end of the deficient node (the separator moves down; the deficient node now has the minimum number of elements)
 Replace the separator in the parent with the first element of the right sibling (right sibling loses one node but still has at least the minimum number of elements)
 The tree is now balanced
 Otherwise, if the deficient node's left sibling exists and has more than the minimum number of elements, then rotate right
 Copy the separator from the parent to the start of the deficient node (the separator moves down; deficient node now has the minimum number of elements)
 Replace the separator in the parent with the last element of the left sibling (left sibling loses one node but still has at least the minimum number of elements)
 The tree is now balanced
 Otherwise, if both immediate siblings have only the minimum number of elements, then merge with a sibling sandwiching their separator taken off from their parent
 Copy the separator to the end of the left node (the left node may be the deficient node or it may be the sibling with the minimum number of elements)
 Move all elements from the right node to the left node (the left node now has the maximum number of elements, and the right node – empty)
 Remove the separator from the parent along with its empty right child (the parent loses an element)
 If the parent is the root and now has no elements, then free it and make the merged node the new root (tree becomes shallower)
 Otherwise, if the parent has fewer than the required number of elements, then rebalance the parent

Note: The rebalancing operations are different for B+ trees (e.g., rotation is different because parent has copy of the key) and B*-tree (e.g., three siblings are merged into two siblings).

Sequential access
While freshly loaded databases tend to have good sequential behavior, this behavior becomes increasingly difficult to maintain as a database grows, resulting in more random I/O and performance challenges.

Initial construction

A common special case is adding a large amount of pre-sorted data into an initially empty B-tree. While it is quite possible to simply perform a series of successive inserts, inserting sorted data results in a tree composed almost entirely of half-full nodes. Instead, a special "bulk loading" algorithm can be used to produce a more efficient tree with a higher branching factor.

When the input is sorted, all insertions are at the rightmost edge of the tree, and in particular any time a node is split, we are guaranteed that no more insertions will take place in the left half. When bulk loading, we take advantage of this, and instead of splitting overfull nodes evenly, split them as unevenly as possible: leave the left node completely full and create a right node with zero keys and one child (in violation of the usual B-tree rules).

At the end of bulk loading, the tree is composed almost entirely of completely full nodes; only the rightmost node on each level may be less than full. Because those nodes may also be less than half full, to re-establish the normal B-tree rules, combine such nodes with their (guaranteed full) left siblings and divide the keys to produce two nodes at least half full. The only node which lacks a full left sibling is the root, which is permitted to be less than half full.

In filesystems
In addition to its use in databases, the B-tree (or ) is also used in filesystems to allow quick random access to an arbitrary block in a particular file. The basic problem is turning the file block  address into a disk block (or perhaps to a cylinder-head-sector) address.

Some operating systems require the user to allocate the maximum size of the file when the file is created. The file can then be allocated as contiguous disk blocks. In that case, to convert the file block address  into a disk block address, the operating system simply adds the file block address  to the address of the first disk block constituting the file. The scheme is simple, but the file cannot exceed its created size.

Other operating systems allow a file to grow. The resulting disk blocks may not be contiguous, so mapping logical blocks to physical blocks is more involved.

MS-DOS, for example, used a simple File Allocation Table (FAT). The FAT has an entry for each disk block, and that entry identifies whether its block is used by a file and if so, which block (if any) is the next disk block of the same file. So, the allocation of each file is represented as a linked list in the table. In order to find the disk address of file block , the operating system (or disk utility) must sequentially follow the file's linked list in the FAT. Worse, to find a free disk block, it must sequentially scan the FAT. For MS-DOS, that was not a huge penalty because the disks and files were small and the FAT had few entries and relatively short file chains. In the FAT12 filesystem (used on floppy disks and early hard disks), there were no more than 4,080  entries, and the FAT would usually be resident in memory. As disks got bigger, the FAT architecture began to confront penalties. On a large disk using FAT, it may be necessary to perform disk reads to learn the disk location of a file block to be read or written.

TOPS-20 (and possibly TENEX) used a 0 to 2 level tree that has similarities to a B-tree. A disk block was 512 36-bit words. If the file fit in a 512 (29) word block, then the file directory would point to that physical disk block. If the file fit in 218 words, then the directory would point to an aux index; the 512 words of that index would either be NULL (the block isn't allocated) or point to the physical address of the block. If the file fit in 227 words, then the directory would point to a block holding an aux-aux index; each entry would either be NULL or point to an aux index. Consequently, the physical disk block for a 227 word file could be located in two disk reads and read on the third.

Apple's filesystem HFS+ and APFS, Microsoft's NTFS, AIX (jfs2) and some Linux filesystems, such as btrfs and Ext4, use B-trees.

B*-trees are used in the HFS and Reiser4 file systems.

DragonFly BSD's HAMMER file system uses a modified B+-tree.

Performance

A B-tree grows slower with growing data amount, than the linearity of a linked list. Compared to a skip list, both structures have the same performance, but the B-tree scales better for growing n. A T-tree, for main memory database systems, is similar but more compact.

Variations

Access concurrency
Lehman and Yao showed that all the read locks could be avoided (and thus concurrent access greatly improved) by linking the tree blocks at each level together with a "next" pointer. This results in a tree structure where both insertion and search operations descend from the root to the leaf. Write locks are only required as a tree block is modified. This maximizes access concurrency by multiple users, an important consideration for databases and/or other B-tree-based ISAM storage methods. The cost associated with this improvement is that empty pages cannot be removed from the btree during normal operations. (However, see  for various strategies to implement node merging, and source code at.)

United States Patent 5283894, granted in 1994, appears to show a way to use a 'Meta Access Method'  to allow concurrent B+ tree access and modification without locks. The technique accesses the tree 'upwards' for both searches and updates by means of additional in-memory indexes that point at the blocks in each level in the block cache. No reorganization for deletes is needed and there are no 'next' pointers in each block as in Lehman and Yao.

Parallel algorithms
Since B-trees are similar in structure to red-black trees, parallel algorithms for red-black trees can be applied to B-trees as well.

See also
 B+ tree
 R-tree
 Red–black tree
 2–3 tree
 2–3–4 tree

Notes

References

Sources

 .
 . Chapter 18: B-Trees.

 . Section 6.2.4: Multiway Trees, pp. 481–491. Also, pp. 476–477 of section 6.2.3 (Balanced Trees) discusses 2–3 trees.

Original papers
 .
 .

External links

B-tree lecture by David Scot Taylor, SJSU
B-Tree visualisation (click "init")
Animated B-Tree visualization
B-tree and UB-tree on Scholarpedia Curator: Dr Rudolf Bayer
B-Trees: Balanced Tree Data Structures
NIST's Dictionary of Algorithms and Data Structures: B-tree
B-Tree Tutorial
The InfinityDB BTree implementation
Cache Oblivious B(+)-trees
Dictionary of Algorithms and Data Structures entry for B*-tree
Open Data Structures - Section 14.2 - B-Trees, Pat Morin
Counted B-Trees
B-Tree .Net, a modern, virtualized RAM & Disk implementation

Bulk loading

Computer-related introductions in 1971
Database index techniques


text:
Plano station may refer to different rail stations in the United States.

 Plano station (Illinois), serving Plano, Illinois
 Downtown Plano station of the Dallas Area Rapid Transit, serving Plano, Texas
 Plano Station, Texas Electric Railway, a historic rail depot served by the Texas Electric Railway
 Parker Road station, the terminus of the Dallas Area Rapid Transit line in Plano, Texas

redpajama_set_name: RedPajamaWikipedia


text:
Kemar Anderson Brathwaite (born 29 September 1993) is a Barbadian cricketer who has represented the Barbados national team in West Indian domestic cricket. A right-handed opening batsman, he made his first-class debut in November 2015, playing against Guyana in the 2015–16 Regional Four Day Competition. In the following match, against the Windward Islands, Brathwaite narrowly missed out on a maiden half-century, scoring 46 in the first innings before being bowled by Shane Shillingford.

References

External links
Player profile and statistics at ESPNcricinfo

1993 births
Living people
Barbadian cricketers
Barbados cricketers


text:
Жабоголовая черепаха или светлокрайняя змеиношеяя черепаха () — крупный вид бокошеих черепах. Представители вида были найдены на востоке и юго-западе Венесуэлы, юго-востоке Колумбии, востоке стран Эквадор и Перу, а также в Бразилии, Боливии, Парагвае, Аргентине и Гайане.

Примечания

Животные, описанные в 1812 году
Змеиношеие черепахи
Пресмыкающиеся Южной Америки


text:
Edgar Allen Diddle Sr., (nacido el  en Gradyville, Pensilvania y fallecido el  en Bowling Green, Kentucky) fue un entrenador de baloncesto estadounidense que ejerció en la Universidad Western Kentucky durante 42 años.

Trayectoria
 Universidad Western Kentucky (1922-1964)

Enlaces externos
 Ficha en sports-reference (NCAA)
 Ficha en hoophall.com

Baloncestistas de Pensilvania
Entrenadores de baloncesto de Estados Unidos
Entrenadores de baloncesto de la NCAA
Miembros del Basketball Hall of Fame


text:
Ezen a lapon a sorszámmal rendelkező kisbolygók listájának egy részlete található.

10501–10600. • 10601–10700. • 10701–10800. • 10801–10900. • 10901–11000.

Források

A Naprendszer kisbolygóinak listája


text:
A chupacabra (ejtsd: csupakabra) vagy chupacabras  állítólag Amerika egyes tájain élő mitikus lény.

Ezidáig Puerto Ricóban (ahonnan először jelentették 1987-ben), Mexikóban és az Egyesült Államokban, elsősorban Latin-Amerikában látták. A név, amely a spanyol cabra chupar ("kecskeszívó") kifejezés összevonása, abból a gyakran jelentett szokásából ered, hogy háziállatokat, gyakran kecskéket támad meg és a vérüket szívja. Sokan sokféleképpen írták le a külsejét. Több állítólagos megfigyelő szerint röpképesek. Bár vannak, akiket komolyan foglalkoztat a létezése, a szakértők szerint a chupacabra csupán szóbeszéd.

Egy könyvben is szerepel néhányszor (az Első enciklopédiám sorozatban). Legtöbbször gyíkszerű lényként ábrázolják.

Chupacabra a tévében
 A Scooby-Doo rajzfilmsorozat egyik filmjében Nagylábként van benne,
 A lény felbukkan a Dexter laboratóriuma című rajzfilmben, mint Dexter egyik szörny teremtménye, név szerint Charlie, ami elszökött. Dexter Dél-Amerikában talál rá újra.
 A Maya és Miguel című mesesorozatban (Minimax) szerepel egy részben, de nem mutatják, csak a gyerekeknek mesélnek róla.
 A Tumak című képregényben említést tesznek róla, valamint az X-akták és a Scooby Doo című tv-sorozatokban a témának szenteltek 1-1 epizódot.
 A Negima?! c. animében "chupa klubot" szerveznek, ami a lénnyel foglalkozik.
 A Red Dead Redemption: Undead Nightmare című játékban feltűnik, ahol egy patkányhoz hasonlít.
 A The Walking Dead című sorozat 2. évad 5. részének címe Chupacabra. Daryl Dixon azt mondja, hogy látott egyet régebben, amikor eltévedt az erdőben. (Valószínűleg hallucinogén gomba hatása alatt volt, amikor ez történt.)
 Az Ozone Network Lény-akták című sorozatában is beszéltek róla : https://web.archive.org/web/20121012223931/http://ozonenetwork.hu/ozonenetwork/dokumentumfilm/20120221-ozonenetwork-musor-lenyaktak.html
 A Csizmás, a kandúr című animációs filmben "El Chupacabra"-nak szólítják a menekülő macskát
 A Generátor Rex című tévésorozat 2. évadjának 8. részében (A helyőrség) szerepel a Chupacabra, aki halálos méreggel fertőzi meg Rexet és a Zöld Ököl két tagját. Azonban a végén kiderül, hogy a Chupacabra nem EVO, Rex elengedi Dr. Holiday pedig egy mintából elkészíti az ellenszert, így mindnyájan megmenekülnek. Disznószerű, agyaras lényként van ábrázolva.
 A chupacabra említést kap a Dr. Csont c. sorozatban is (6. évad, 18. rész). Egy gyilkosság "gyanúsítottjaként" jelenik meg a lény.
 A chupacabra feltűnik az NBC csatorna nagy sikerű sorozatában, az X-Akták 4. évadának 11. Chupacabra című epizódjában.
A chupacabrát a Phineas and Ferb (Finiesz és Förb)-ben is feltűnik.
A Grimm című sorozatban is szerepel, a 4. évad 8. részében. Ez az epizód címe is.
Az Odaát (Supernatural) című sorozatban is megemlítik, mint természetfeletti lényt. (2. évad 3. része)
A Chupacabra - Potyautas a halál (Chuapacabra Terror, 2005,) című filmben egy szállodahajó utasait tartja rettegésben
A Victor és Valentino című rajzfilmsorozatban is felbukkan egy rész erejéig, amelyben képes beszélni, illetve megcáfolja azt, hogy vérszívó fenevad lenne, röviden csak "Chupa"-nak hívja magát.

További információk
 El Chupacabra - A vérszívó (blog)

Kriptidek


text:
Ola Christoffer Nordenrot, (born 9 March 1986) is a Swedish actor. He had the leading role of Alex in the film Den blomstertid nu kommer in 2018. Previously he has had roles in Kenny Begins, Wallander – Mordbrännaren and Sune – Best Man.
He also appeared in UFO Sweden.

References

External links

21st-century Swedish male actors

1986 births
Living people


text:
Eglise Gutiérrez es una soprano lírica de coloratura nacida en Holguín, Cuba emigrada a Miami, Estados Unidos.

Estudió en La Habana, Miami y Filadelfia en la Academy of Vocal Arts debutando como Lucía de Lammermoor en Bogotá, Colombia, en 2003.

Ganadora en los concursos Mirjam Helin, Montserrat Caballé y Marian Anderson, su debut europeo fue en el Festival de Wexford como Maria di Rohan de Donizetti en 2005.

En 2003 debutó en Carnegie Hall de New York en el Réquiem de Mozart y en la Misa Solemnis de Beethoven prosiguiendo en temporadas consecutivas como Philine en Mignon, Lakmé y como Amina en La Sonnambula de Bellini papel que ha cantado también en Cagliari y en Detroit dirigida por Renata Scotto.

Ha cantado en Helsinki, Praga, Niza, en la Ópera de Seattle, Elvira en I Puritani y Violetta en La Traviata (también en Cincinnati y Miami), Lucia di Lammermoor en el Palacio de Bellas Artes de México, el Teatro Colón de Buenos Aires y el Festival de Savonlinna en Finlandia, Gilda (Rigoletto) en Hamburgo, Vancouver, Trieste, Roma, Atenas, en Cendrillon de Massenet en la Ópera de Santa Fe y en la Ópera de Sarasota como Lakmé.

Otros personajes de su repertorio son Nannetta en Falstaff, Hanna Glawari en La Viuda Alegre, Liù en Turandot, Adina en Elisir d'amore, Doña Francisquita y en la zarzuela cubana Cecilia Valdés.

En la temporada 2010 debutó como Linda di Chamounix en el  Covent Garden de Londres.

Enlaces externos

 Sitio oficial
 Artículo en Opera News
 Como Ofelia de Hamlet en Helsinki
 Artículo en inglés
Canciones de Joaquín Rodrigo
La Sonnambula, Cagliari 2008

Sopranos de Estados Unidos
Emigrantes cubanos hacia Estados Unidos
Cantantes femeninas de Cuba
Sopranos en el Teatro Real
Nacidos en Holguín


text:
The 2021 Empress's Cup Final was the final of the 2021 Empress's Cup, the 43rd edition of the Empress's Cup.

The match was contested at the Sanga Stadium by Kyocera in Kyoto.

Teams

Road to the final

Format
The final was played as a single match. If tied after regulation time, extra time and, would it necessary, a penalty shoot-out would have been used to decide the winning team.

Details

References

External links
 Empress's Cup JFA 43rd Japan Football Championship
 天皇杯 JFA 第43回全日本サッカー選手権大会

2021 in Japanese football
2021 in Asian football
2021 in Japanese sport
Emperors Cup Final, 2021


text:
VDNCh () je stanice moskevského metra v severní části Kalužsko-Rižské linky. Pojmenována je podle nedalekého výstaviště.

Charakter stanice

VDNCh je podzemní ražená trojlodní stanice, založená 53,5 m hluboko. Není přestupní a má dva povrchové vestibuly (první je původní, druhý dobudován roku 1997), které jsou s nástupištěm spojené eskalátorovými tunely.

Jako severní konečná pro linku Rižskaja byla VDNCh otevřena 1. května 1958. Stejně jako celý první úsek oranžové linky, i tato stanice odpovídá době ústupu od stalinistického k strohému architektonickému provedení. Původně měly být například v prostupech dekorativní mozaiky, ty však nakonec byly odstraněny. Osvětlení je však stále zajišťováno lustry.

V letech 1991 a 1992 se objevilo několik námětů na přejmenování stanice (v této době v celé síti metra byla odstraněna alespoň část ideologických názvů), k němuž nakonec nedošlo.

V současné době ji využije každý den okolo 119 000 cestujících, což VDNCh činí jednu z nejvíce vytížených v celé síti metra.

VDNCh v kultuře
Na stanici VDNCh se odehrává začátek knihy Metro 2033 od Dmitrije Gluchovského.

Poznámky

Externí odkazy

 Profil stanice na stránkách Mymetro.ru (rusky)
 Fotogalerie na stránkách Elektrodepo Sviblovo (rusky)
 Informace a fotografie na stránkách metrowalks.ru (rusky)

Stanice metra v Moskvě


text:
Valèria Dmítrievna Khomiakova, , (Moscou, 1914 - Província de Saràtov, 6 d'octubre de 1942) fou una militar soviètica, pilot de la Força Aèria Soviètica abans i durant la Segona Guerra Mundial.

Biografia

Abans de la Guerra
Nascuda l'any 1914 a Moscou en una família d'enginyers químics, fou una pilot acrobàtica de renom juntament amb Raïssa Beliàieva i Ievguénia Prokhorova. Van fer diverses demostracions d'acrobàcies aèries davant de milers de persones al camp d'aviació de Touchino de la capital russa.

Durant la Guerra
Quan va esclatar la Segona Guerra Mundial, es va integrar a la Força Aèria Soviètica, concretament al 586è Regiment de Caces, part integrant del Grup d'Aviació núm. 122. La nit del 24 de setembre de 1942 fou abatuda per un bombarder Ju-88 sobre Saràtov. Uns dies més tard, el 6 d'octubre, en circumstàncies poc clares. Després de la seva primera victòria en combat aeri, la primera del 586è Regiment de caça, se la va enviar el 29 de setembre a Moscou per rebre els honors. Tant punt va tornar, als pocs dies, esgotada pel viatge, va ser assignada immediatament a la guàrdia nocturna.

Ielena Karakorskaia i Iekaterina Polulina van fer constar la impossibilitat de poder navegar en aquelles condicions. Tot i així, el 5 d'octubre de 1942 la major Tamara Kazarinova va ordenar el vol i, sense ajuda de la il·luminació adequada, es va estavellar i va morir. Oficialment es va informar de la defunció com a mort en combat i ningú se'n va preocupar. Això no obstant, tothom sabia que es tractava d'una mort per manca de diligència de la major Kazarinova i fou després d'aquest tràgic succés que el general Mikhaïl Gromadin va decidir rellevar-la del càrrec i va ordenar al tinent Aleksandr Ossipenko que obrís una investigació sobre la seva mort. Poc després, Ossipenko transferí la major Kazarinova dins del seu personal i cap investigació es va acabar obrint.

Referències

Bibliografia

Moscovites
Aviadors soviètics
Militars soviètics de la Segona Guerra Mundial
Orde de la Bandera Roja
Alumnes de la Universitat de Tecnologia Química Dmitri Mendeléiev de Rússia
Morts a Rússia
Militars russos
Morts el 1942


text:
Tantilla boipiranga é uma espécie vulnerável de serpente da família Colubridae, pertencente ao grupo Tantilla melanocephala.

Distribuição
A espécie é endêmica de Minas Gerais e do Espírito Santo no Brasil. Inicialmente descrita unicamente no Parque Nacional da Serra do Cipó, posteriormente teve sua distribuição ampliada para diversas regiões, incluindo algumas no Quadrilátero Ferrífero e na Bacia do Rio Doce, Caratinga, ao longo de toda a porção mineira da Cordilheira do Espinhaço, incluindo sua porção mais ao norte nos municípios de Almenara e Berilo, Taiobeiras, Santa Maria do Salto (próximo à Bahia) e os municípios de Linhares; São Mateus e Pedro Canário, no Espírito Santo. Vive em uma área total de ~134,200 km², entre 38 m e 1368 m acima do nível do mar, e em diferentes formações vegetais, como a Floresta Costeira da Bahia, Florestas do Interior da Bahia, Cerrado, e, sobretudo, os Campos rupestres.

Descrição
O holótipo de Tantilla boipiranga é um macho adulto de cerca de 384 mm e 9 g. É uma serpente laranja-avermelhada com o topo da cabeça marrom e focinho laranja claro na altura das narinas. Uma gola de cor laranja está presente e é marcada no meio por uma fina linha escura, seguida por uma faixa marrom-acinzentada. Sua morfologia varia com sua área de ocorrência.

Etimologia
O nome boipiranga vem do tupi mboi ou boi, "cobra", e piranga,"vermelho".

Publicação original
 Sawaya & Sazima, 2003: A new species of Tantilla (Serpentes: Colubridae) from southeastern Brazil. Herpetologica, vol 59, n. 1,  (texto integral)

Fauna endêmica da América Latina
Fauna endêmica do Brasil
Espécies vulneráveis
Serpentes
Répteis do Brasil
Biodiversidade dos Campos Rupestres
Colubridae
Répteis da América do Sul
Répteis descritos em 2003
Animais descritos em 2003
Espécies descritas em 2003


text:
Zygomelon zodion är en snäckart som beskrevs av Harasewych och B.A. Marshall 1995. Zygomelon zodion ingår i släktet Zygomelon och familjen Volutidae. Inga underarter finns listade i Catalogue of Life.

Källor

Snäckor
zodion


text:
The Platte Valley Conference (PVC) was a northwest Missouri-based athletic conference that featured exclusively small, primarily rural schools that are member institutions of the Missouri State High School Activities Association (MSHSAA).  This conference was considered one of the stronger sports leagues in class 1 of Missouri sports. It disbanded in 2016 when it merged with the 275 Conference.

Sports
Member schools in the PVC fall football lineup included the Dekalb Tigers, North Andrew Cardinals, Southwest Livingston Wildcats, South Nodaway Longhorns, Stewartsville Cardinals, and Union Star Trojans. These teams competed in Missouri eight-man football.

For basketball, the conference kept most of its football competitors: the Dekalb Tigers, North Andrew Cardinals, South Nodaway Longhorns, Stewartsville Cardinals, and Union Star R-2 Trojans. Also in the PVC basketball group were the Jefferson Eagles, Northeast Nodaway Bluejays, and the Osborn Wildcats.
Starting in 2011-2012, the Platte Valley Conference has had a conference basketball tournament featuring the 8 basketball schools.

On February 6, 2015, the Grand River Conference accepted North Andrew and they moved to the GRC starting in the 2016-2017 school year.  The remainder of the PVC joined the 275 Conference starting in the 2016-2017 school year.

List of member schools

Former members
In years past, the Platte Valley Conference also included Fillmore, but the town's high school consolidated with the North Andrew School District in 1993.  The conference also included Elwood, KS through the 2010-2011 school year when they consolidated with Wathena, KS to form Riverside High School.

References

High school sports conferences and leagues in the United States
Missouri high school athletic conferences


text:
Oliver Remigius, Count von Wallis Baron von Carrighmain, the scion of a distinguished Irish family in Habsburg military service, served in Austria's wars with the Ottoman Empire (1787–1791), and in the French Revolutionary Wars (1791–1800). He died of wounds received in action at the First Battle of Zürich.

Family and youth
Oliver Remigius was born on 1 October 1742 into an Irish emigrant family living in the Habsburg Monarchy. During the 17th century, laws introduced in Ireland limited, and eventually removed, authority from the Catholic aristocracy, preventing Catholics from inheriting land, sitting in Parliament, and holding office. Many immigrated to Central Europe and sought service in the Habsburg military. One ancestor, Richard Wallis, or Walsh, as he had been known in Ireland, emigrated with his family in 1612, and was a colonel in the Habsburg military. He was killed at the Battle of Lützen in 1632. Another ancestor of Oliver Remigius, George Olivier, Count von Wallis (son of Richard), also served in the Habsburg military during the Thirty Years War under Wallenstein.

Wallis and his older brother Michael Johann Ignaz were both intended for military service. As a young man, Wallis entered his father's regiment, the 11th Infantry, and from 1769 to 1777, he commanded it. On 26 November 1777, he was promoted to major general. In the wars against the Turks (1787–92) he served under Field Marshal Ernst Gideon von Laudon and, later, Count von Charles Joseph de Croix, Count of Clerfayt. In 1787, he was promoted to Feldmarschall-leutnant, and in 1791, as Colonel-Proprietor of the 29th Infantry Regiment, which bore his name until 1802.

French Revolutionary Wars
In the 1792 campaign of the War of the First Coalition, Wallis commanded a mixed division in the corps of Friedrich Wilhelm, Fürst zu Hohenlohe-Kirchberg, on the upper Rhine and the Moselle, stationed on the Rhine river between Basel and Strassburg. On 21 May 1794, he received his promotion to Feldzeugmeister, or Field Marshal of Artillery. In late 1795, he was transferred to northern Italy. On 22 November, he assumed command of the Army of Lombardy from Joseph Nikolaus De Vins, on the eve of the Battle of Loano. On 24 November, he lost all his artillery and wagon train in the clash of San Giacomo. In April 1796, he was relieved of his command of the Habsburg army in Lombardy by Johann Peter Beaulieu.

In 1798, Wallis was commanding General of Venetia. The following year, during the War of the Second Coalition, he commanded part of the Habsburg army in Swabia under Archduke Charles. He led the third column in its assault on the French positions in the Habsburr victory over General of Division Jordan's Army of the Danube at the Battle of Ostrach on 21 March. A week later, and in the French defeat at Stockach on 25 March, he commanded the right wing. From 14 to 25 April, while Archduke Charles was indisposed, Wallis assumed command of the main Habsburg army quartered on the shore of the Rhine River. A few weeks later, he commanded the reserve in the First Battle of Zürich on 4 June, where General of Division André Masséna, now commanding the Army of the Danube and the Army of Switzerland, was defeated and forced to withdraw across the Limmat river. During the battle, Wallis led five battalions of grenadiers in storming the French positions on Mount Zürich. He was badly wounded, and died five weeks later, on 19 July 1799.

Sources

Citations and notes

Bibliography
  Ebert, Jens-Florian. "Wallis, Olivier Remigus, Count von." Die Österreichischen Generäle 1792–1815. Accessed 26 December 2009.
 Littell, Eliakim and Robert S. Littell. Littell's living age. Boston, MA: T.H. Carter & Co., 1844–1896. Volume 115 (1872).
 Smith, Digby. The Napoleonic Wars Data Book. London: Greenhill, 1998. .
 Smith, Digby. "Wallis". Leopold Kudrna and Digby Smith (compilers). A biographical dictionary of all Austrian Generals in the French Revolutionary and Napoleonic Wars, 1792–1815. Napoleon Series, Robert Burnham, editor in chief. April 2008 version. Accessed 15 December 2009.
  Stanka, Julius (Major). Geschichte des K. und K. Infanterie-Regimentes Erzherzog Carl No. 13. Wien: im Selbstverlag des Regiments, 1894. Volume 1.

1742 births
1799 deaths
18th-century Austrian people
Austrian generals
Austrian Empire military leaders of the French Revolutionary Wars
Barons of Austria
Austrian people of Irish descent
Military leaders of the French Revolutionary Wars killed in battle
Nobility from Vienna
Military personnel from Vienna


text:
Hemiphileurus elbitae är en skalbaggsart som beskrevs av Neita och Brett C.Ratcliffe 2010. Hemiphileurus elbitae ingår i släktet Hemiphileurus och familjen Dynastidae. Inga underarter finns listade i Catalogue of Life.

Källor

Skalbaggar
elbitae


text:
Derarimus curticornis es una especie de coleóptero de la familia Anthicidae.

Distribución geográfica
Habita en Vietnam.

Referencias

Curticornis
Coleópteros de Vietnam


text:
Ivan V. Lalić (8 June 1931 – 28 July 1996) was a Serbian and Yugoslav poet. He was also a translator of poetry from English, French and German into his mother tongue.

Biography
Lalić was born in Belgrade; his father, Vlajko, was a journalist, and his grandfather Isidor Bajić was a composer. His poems tell of a happy childhood, but also of two teenage traumas. As a child in Belgrade, many of his school-friends perished in a 1944 air-raid - as described in the poem "Zardjala igla (A rusty needle)". Lalić said that "my childhood and boyhood in the war marked everything I ever wrote as a poem or poetry".  A second trauma was the loss of his mother, Ljubica Bajić, from tuberculosis in 1946.

Ivan V. Lalić finished high school in Zagreb, where he studied law. Here he met his wife Branka (née Kašnar), who was studying English and music. They married in 1956. Ivan described her as "the spirit behind my poems", and her presence remains in his verse at all stages of his poetic oeuvre.

Ivan V. Lalić published his first poems in 1952, and his first collection of poetry in 1955; the last appeared in 1996, the year of his death. After initially working as a literary editor for Radio Zagreb, he moved to Belgrade in 1961 to take up a new post: Secretary of the Yugoslav Writer's Union. Then, from 1979 until his retirement in 1993, he worked as an editor for the Nolit publishing house in Belgrade.

Ivan and Branka Lalić spent the summers with their family in the Istrian town of Rovinj. They had two sons. The elder, Vlajko, died in a sailing accident between Rovinj and Venice in 1989. Ivan V. Lalić died suddenly in Belgrade in 1996. He was survived by his wife Branka, and his younger son Marko.

Thought and themes
In her obituary of Lalić, Celia Hawkesworth spoke of "the central place in his work of memory: fragile in the face of the collapse of civilisations, but all we have. Memory allows the poet to recreate brief instants of personal joy as well as to conjure up a sense of the distant past. It allows each of us, as individuals condemned to solitude, to connect with a shared inheritance and feel, for a moment, part of a larger whole."

Legacy
Lalić is recognised as one of Yugoslavia's and Serbia's most accomplished poets. In Aleksandar Jovanović's words, "his work does not only stand at the peak of Serbian poetry in the second half of [the 20th] century, but is at the peak of Serbian poetry in general".

Lalić was admired abroad and books of his poems have been translated into six languages (English, French, Italian, Polish, Hungarian and Macedonian). Individual poems have appeared in more than 20 languages. UK critics have described his work as "vital and intense", with a "magisterial transcendent quality", and his "lyrics [as] ablaze with successes of metaphor", with an "irresistible blend of private lyricism and public force".

Awards
Lalić was awarded many literary prizes, including Yugoslavia's and Serbia's most prestigious awards:
Nagrada tribine mladih (1960),
Zmajeva nagrada (1961),
Nagrada jugoslovenske radiodifuzije (1965),
Nolitova nagrada (1969),
Nagrada "Miloš Đurić" (1978),
Nagrada "Branko Miljković" (1985),
Gost Disovog proleća (1987),
Oktobarska Nagrada Beograda (1988),
Thornton Wilder Prize (USA, 1990),
Nagrada "Meša Selimović" (1992),
Nagrada "Stanislav Vinaver" (1992),
Nagrada lista Borba (1992),
Velika Bazjaške povelja (Romania, 1994),
Nagrada "Braća Micić" (1995)
Nagrada "Vasko Popa" (1996),
Žička hrisovulja (1996),
Račanska povelja (1996),
Vitalova Nagrada "Zlatni suncokret" (1996).

Bibliography
During his long poetic career, Ivan V. Lalić published eleven collections of poetry in his mother tongue.
 Bivši dečak ('Once a Boy', 1955)
 Vetrovito proleće ('Windy Spring', 1956)
 Velika Vrata Mora ('The Great Gates of the Sea', 1958)
 Melisa ('Melissa', 1959)
 Argonauti i druge pesme ('The Argonauts and other poems', 1961)
 Čin ('Act', 1963)
 Krug ('Circle', 1968)
 Smetnje na Vezama ('Fading Contact', 1975)
 Strasna Mera ('The Passionate Measure', 1984)
 Pismo ('Script', 1992)
 Četiri kanona ('Four Canons', 1996)
Lalić also produced two selections of his work:
 Vreme, vatre, vrtovi ('Time, Fires, Gardens', 1961). This includes the complete Melisa, plus poems selected from his other four early books, including Argonauti i druge pesme. In this volume, Lalić defined the early poems that he saw as part of his poetic legacy, and set aside what he saw as slighter juvenilia: he regarded it not as "a book of selected poems, but […] his first real book".
Izabrane i nove pesme ('Selected and New Poems', 1969) – published in English translation as A Rusty Needle. The "selected" poems are largely from Vreme, vatre, vrtovi and his two subsequent books Čin and Krug. The "new" poems form the cycle O delima ljubavi, ili Vizantija ('Of the Works of Love, or Byzantium').
A compilation of all Ivan V. Lalić's published work – Dela ('Works') – was in preparation at his sudden death in 1996. Edited by Aleksandar Jovanović, it appeared in 1997. It contains three volumes of poetry and one of prose.

In English translation

Poems by Lalić, in his own translation, appeared in the landmark 1965 first issue of Modern Poetry in Translation (ed. Ted Hughes and Daniel Weissbort) - an influential UK magazine which helped to establish 'new European poetry' as a driving force in UK poetic culture.

Two book-length selections of Ivan V. Lalić's poetry appeared in Charles Simic's translation, both in the USA:
Fire Gardens (New Rivers, 1970)
Roll Call of Mirrors (Wesleyan University Press, 1988).
Six editions of Ivan V. Lalić's poetry have appeared in Francis R. Jones's translation. Five are with Anvil Press (London):
The Works of Love: Selected Poems (1981)
Last Quarter: Poems from The Passionate Measure (1985), co-published with Turret, London
The Passionate Measure (1989), a translation of Strasna mera, co-published with Dedalus, Dublin
A Rusty Needle (1996), a translation of Izabrane i nove pesme
Fading Contact (1997), a translation of Smetnje na vezama
The sixth appeared with Belgrade University's Univerzitetska biblioteka "Svetozar Marković":
 Walking Towards the Sea / Koraci prema moru (2014)

External links
Translated works by Ivan V. Lalić

References

1931 births
1996 deaths
Writers from Belgrade
Serbian male poets
20th-century Serbian poets


text:
Coshocton – miasto w Stanach Zjednoczonych, w stanie Ohio, siedziba władz hrabstwa o tej samej nazwie. Liczba mieszkańców w 2000 roku wynosiła 12 011.

Miasto leży w strefie klimatu wilgotnego, łagodnego, subtropikalnego, bez pory suchej i z gorącym latem, należącego według klasyfikacji Köppena do strefy Cfa. Średnia temperatura roczna wynosi 10,8°C

Przypisy

Miasta w stanie Ohio


text:
Marcus Asinius Marcellus was the name of two men of the Asinii.

Marcus Asinius Marcellus, the Elder

Marcus Asinius Marcellus was consul in 54 as the colleague of Manius Acilius Aviola; it was the same year the Emperor Claudius died. According to Paul von Rohden, Marcellus was the son of Marcus Asinius Agrippa, consul in 25, and the paternal grandson of Vipsania Agrippina, although he admits to the slight chance Marcellus was a grandson of Asinia and Marcus Claudius Marcellus.

Marcellus was a Senator active in the reigns of the emperors Claudius and Nero. In the year 60 Marcellus was caught up in a scandal involving a relative of a Praetor who forged his will. The associates in the scandal were disgraced and punished. Although Marcellus was also disgraced and his accomplices executed, he escaped punishment because the Emperor Nero intervened--reportedly because he was "great-grandson of Asinius Pollio and bore a character far from contemptible."

Marcus Asinius Marcellus, the Younger
The younger Marcus Asinius Marcellus was a consul ordinarius in 104  as the colleague of Sextus Attius Suburanus Aemilianus, and son or grandson of the consul of 54. Edmund Groag suggested he is identical to the homonymous man mentioned as a member of the College of Pontifices around AD 101/102. Nothing more is known of him.

References

Senators of the Roman Empire
Imperial Roman consuls
1st-century Romans
2nd-century Romans
Marcellus, Marcus
Year of birth unknown
Year of death unknown


text:
Scott N. Heidepriem (born June 25, 1956) is an American attorney and former South Dakota state legislator.

Early life, education, and career
Heidepriem graduated with his bachelors, masters, and juris doctor from the University of South Dakota. He later graduated from John F. Kennedy School of Government with a masters in public administration.

Heidepriem is a past president of the South Dakota Trial Lawyers.

Political career

In 1986, Heidepriem ran for the Republican nomination for the United States House of Representatives from South Dakota's At-large congressional district, but he lost to Dale Bell.

In 2000, Heidepriem switched from the Republican party to the Democratic Party.

In 2006, Heidepriem successfully ran as a Democrat for the South Dakota State Senate and was re-elected in 2008 against State Representative Phyllis Heineman. While in state legislature, he was the Speaker of the House, Pro Tempore, chairman of the Senate Judiciary Committee, and Senate Minority Leader for four years.

in 2010, Heidepriem was the Democratic nominee for Governor of South Dakota and attempted to run on an bi-partisan ticket. However, Secretary of State Chris Nelson would not certify the nomination, due to a state law requiring all candidates of a particular political party to belong to that party. Polls indicated that Heidepriem would have a difficult time winning in such a conservative state; this was validated when he lost the election with only 38.49% of the vote.

Selected works

Books
Bring on the Pioneers!, The State Publishing Co. (1978), a history of Hand County
A Fair Chance for a Free People, Leader Printing Company (1988), a biography of Karl E. Mundt.

Publications

"Tort Reform in South Dakota - The Plaintiff's Perspective," co-authored with Nancy Turbak Berry, Vol. 42, Issue 2, 1999

References

External links
Senator Scott Heidepriem, Minority Leader official South Dakota Legislature site

Scott Heidepriem for Governor official campaign site

1956 births
Harvard Kennedy School alumni
Living people
Democratic Party South Dakota state senators
University of South Dakota School of Law alumni
People from Miller, South Dakota
South Dakota lawyers
Writers from South Dakota
21st-century American lawyers
20th-century American lawyers


text:
Casanova Elvo é uma comuna italiana da região do Piemonte, província de Vercelli, com cerca de 246 habitantes. Estende-se por uma área de 16 km², tendo uma densidade populacional de 15 hab/km². Faz fronteira com Collobiano, Formigliana, Olcenengo, San Germano Vercellese, Santhià, Villarboit.

Demografia

Comunas de Vercelli (província)


text:
Прізвище
 Мануте Бол — професійний баскетболіст із Судану, один із найвищих гравців НБА
  — фламандський художник, представник Північного маньєризму
 Еліс Бол — американська вчена-хімік, перша афроамериканка, яка закінчила Гавайський університет зі ступенем магістра.
 Фемке Бол — нідерландська легкоатлетка, олімпійська медалістка.

Географічні об'єкти
 Бол — містечко і однойменний муніципалітет у Хорватії на півдні острова Брач у складі Сплітсько-Далматинської жупанії. Знаменитий адріатичний курорт у середній Далмації.
 Бол (Чад) — місто республіки Чад, столиця регіону Лак і департаменту Мамду, який до нього входить.
  — річка в Росії, протікає по Архангельській області.
  — річка в Росії, протікає по Архангельській області.


text:
4001 Ptolemaeus eller 1949 PV är en asteroid i huvudbältet, som upptäcktes 2 augusti 1949 av den tyske astronomen Karl Wilhelm Reinmuth i Heidelberg. 1991 fick den officiellt sitt namn efter den grekiske astronomen Klaudios Ptolemaios.

Asteroiden har en diameter på ungefär 4 kilometer och den tillhör asteroidgruppen Duponta.

Referenser

Huvudbältesasteroider
Duponta-asteroider
Småplaneter namngivna efter personer
Astronomiska upptäckter av K Reinmuth
Astronomiska upptäckter 1949


text:
Tapta, née Maria Wierusz Kowalski le  à Kościan et morte le  à Bruxelles, est une sculptrice belge d'origine polonaise. Elle contribue à diversifier la création textile et ouvre la voie vers la recherche pluridisciplinaire. Elle influence des générations d'artistes à travers sa pratique et son enseignement à La Cambre et au Tamat.

Biographie
Maria Wieruz Kowalski est née à Kościan en Pologne, le 7 avril 1926. Son père, Władysław Boye est ingénieur et sa mère, et d'Anna Maria Rzaśnicka, peintre. Son mari Krzysztof Wieruz Kowalski est le petit-fils du peintre Alfred Wierusz-Kowalski (1849-1915). Durant la seconde Guerre mondiale, elle entre dans la résistance avec son mari Christophe Wierusz-Kowalski. Ils participent à l'insurrection de Varsovie en 1944 puis fuient le pays pour s'exiler en Belgique comme réfugiés politiques. Elle étudie à l'École nationale supérieure des arts visuels de La Cambre à Bruxelles et obtient son diplôme de l' Atelier d'Art du Tissu en 1949.

Elle vit alors avec son mari, pendant dix ans, de 1950 à 1960, au Congo belge où elle se familiarise avec des techniques textiles et en expérimente de nouvelles.

Sa carrière artistique commence véritablement à son retour, avec une première exposition en 1966, à la Galerie des métiers à Bruxelles.

Dès ces débuts, elle renouvelle l'art de la tapisserie avec des matériaux bruts dans une gamme réduite de couleurs souples et des formes sculpturales, souvent monumentales. Elle travaille des sculptures de cordages très structurés dont la dernière réalisation marquante est la station de métro Veeweyde, à Bruxelles, intitulée « Voûtes flexibles » (1983-1985).

En 1980, Tapta estime que sa pratique artistique autour du textile l'enferme dans une catégorie considérée plus décorative qu'artistique. Elle se tourne vers des matériaux industriels plus résistants, comme le caoutchouc, le béton, las câbles, et le métal. Elle porte sa recherche sur la flexibilité des matériaux, la rigueur et la radicalité des lignes et des formes découpées, crée des espaces qui n'ont ni intérieur, ni extérieur, des volumes déployés au sol ou couchés. La couleur noire domine, de façon à intensifier l'énergie et la tension. Les œuvres trouvent une nouvelle place dans l'espace, après avoir été suspendues dans les airs, elles prennent appui sur le sol et sont souvent installées en extérieur.

En 1985, elle crée « Transit » et en 1992 « Lieu de transition », au musée en plein air du Sart-Tilman, à l'Université de Liège,– comme des lieux de transition, de médiation et de liberté.

A partir de 1993, elle intègre la lumière à ses œuvres afin de jouer du contraste entre matière et immatérialité. Par la suite, Tapta étend encore sa recherche artistique à la lumière et à l'élément liquide, concevant des  sculptures flottantes conçues pour le lac de Monate et la lagune de Venise pour la Biennale de 1995 et "Esprit Ouvert", plan d'eau et sculpture en acier à Bruxelles, en 1997.

De 1976 à 1990, elle dirige l'atelier d'Art textile de La Cambre qu'elle renomme "Sculpture souple" et, à partir de 1980, l'atelier Structure de la Fondation de la tapisserie à Tournai.

Tapta décède le 27 décembre 1997 à Bruxelles.

A l'occasion du dixième anniversaire de sa mort, ses anciens élèves, assistants et amis organisent une exposition dans son ancien atelier, au cours de laquelle ils associent les œuvres de Tapta à celles de neuf artistes contemporains, dont Gwendoline Robin, Luc Grossen, Michel Clerbois, Bénédicte Henderick, Ymane Chabi-Gara, Marc Rossignol, Gudny Rosa Ingimarsdottir et Jean-Marc Liben-Steyns.

Œuvres
Les œuvres de Tapta figurent dans des musées comme les Musées royaux des Beaux-Arts de Belgique, le Musée d'art contemporain d'Anvers, des collections privées et dans l'espace public comme au Sart Tilman, à la gare du Nord à Bruxelles et à Louvain-la-Neuve. Elle réalise aussi des interventions liées à l'architecture de nombreux bâtiments comme l'ambassade de Belgique à Helsinki, le Centre de Navigation de Butgenbach, la Salle de Conseil de la Communauté française de Belgique à Bruxelles, le hall d'entrée du Ministère des Finances à Bruxelles et à Verviers, le Musée de Louvain-la-Neuve et la station Veeweyde dans le métro bruxellois.
 1985 : Voûtes flexibles, à la station Veeweyde du Métro de Bruxelles ;
 1988 : Niké ou Projection de forces, à Louvain-la-Neuve (angle de la rue des Bruyères et de la rue Pierre-Joseph Redouté) ;
 1992 : Transit, au Musée en plein air du Sart-Tilman, à l'Université de Liège ;
 1992 : Lieu de transition, au Musée en plein air du Sart-Tilman, à l'Université de Liège ;
 1995 : Pour Venise, Biennale de Venise
 1997 : L'esprit ouvert, sur le boulevard du Roi Albert II, à Bruxelles

Expositions (sélection)

 1969 : 4e Biennale internationale de Lausanne
 1975 : Triennale internationale de la tapisserie, Łódź
 1979 : Triennale internationale de la tapisserie,  Łódź
 1980 : 10e Biennale internationale de Lausanne
 1981 : Musée d'art moderne de Paris
 1982 : Intégration, musée de Louvain-la-Neuve
 1985 :
 Fibres Art 85, Musée des arts décoratifs de Paris
 Artelaguna, Biennale de Venise
 1986 : Musée de Verviers
 1995 : Belgio, Carignan
 1994 : Confrontations, Anvers, Bruxelles, Liège…
 1997 :
 Galerie La Cité, Luxembourg
 Zacheta, Varsovie
 2008 : Tapta, affinités.Tapta et 9 artistes contemporains, Atelier Tapta, Bruxelles
 2011 : Tapta 1926-1997, Grande Halle des abattoirs, Mons
 2017 :  Sculpting Belgium, La sculpture en Belgique durant les Trente Glorieuses 1945 / 1975, La Patinoire Royale, Galerie Valérie Bach, Bruxelles
 2019 : Hommage à Tapta Wierusz-Kowalski, Tamat, Tournai

Distinctions
 1964 : Prix Alphonse Muller

 1975 : Prix de la ville de Łódź

 1968 : Prix de la Commune de Forest

Élèves
 Marie-Jo Lafontaine
 Ann Veronica Janssens

Article connexe
 Œuvres d'art du métro de Bruxelles

Bibliographie

 Bernard Marcelis, (texte), Tapta, Edition Musée 16, Louvain-la-Neuve, 1988, 59p.
 Michel Baudson, Tapta, (catalogue exposition Le Botanique, Bruxelles du 18/3-8/5/1994), ARTGO, Mons, 1994,Collection d'entretiens et d'images/Claude Lorent, n°3, 74p.
 Raymond Balau (texte), Tapta (catalogue exposition Galerie d'art contemporain Zacheta, Varsovie septembre-octobre 1997), Galerie d'art contemporain Zacheta, Varsovie,1997, 54p
 Virginie Mamet, Tapta : fibres et vie, (catalogue exposition TAMAT, Tournai du 11/5-16/6/2018), TAMAT, Tournai, 2019, 54p.
  Liesbeth Decan, Tapta, Varsovie, Fundacja Arton, 2010

 Liens externes

 Blog consacré à Tapta

Références

Sculpteur belge du XXe siècle
Sculptrice belge
Artiste textile du XXe siècle
Naissance en avril 1926
Naissance à Kościan
Décès en décembre 1997
Décès à Bruxelles
Décès à 71 ans
Mononyme


text:
Extremadura Unión Deportiva, kurz Extremadura UD war ein spanischer Fußballverein aus der Stadt Almendralejo in der Provinz Badajoz in der autonomen Gemeinschaft Extremadura. Der Verein spielte zuletzt in der Segunda División B, der dritthöchsten spanischen Fußballliga. 2022 wurde er nach finanziellen Schwierigkeiten aufgelöst.

Geschichte

Durchmarsch von der Sechst- in die Drittklassigkeit
Die Geschichte der Extremadura UD begann etwa um das Jahr 2007, als der ebenfalls aus Almendralejo stammende Club de Fútbol Extremadura bereits mit erheblichen finanziellen Schwierigkeiten zu kämpfen hatte. Bereits zu dieser Zeit überlegte man einen neuen Verein in der Stadt zu gründen oder gegebenenfalls den 1986 gegründeten und im unterklassigen Amateurfußball vertretenen Klub Atlético San José Promesas zu übernehmen. Dennoch entschied man sich für eine komplette Neugründung, wobei der von vielen Seiten geförderte Klub im Sommer 2007 öffentlich vorgestellt wurde. Als erster Präsident des Klubs, der als Alternative des einstigen Erfolgsklubs der Region gegründet wurde, fungierte Diego Madera, unter dessen Führung der neue Vereins in der Saison 2010/11 erstmals in der dritthöchsten spanischen Spielklasse agierte und der dem Verein bis zu seinem Rückzug aus dem Präsidentenamt im Sommer 2014 treu blieb.

Seinen Spielbetrieb nahm der neue Klub noch in der Saison 2007/08 in der regionalen 1ª Categoría, der spanischen Sechstklassigkeit, auf und wurde unter Trainer Juan Francisco Godoy, genannt Pinky, in dieser umgehend Meister. 2008/09 traf Extremadura UD in der fünftklassigen Regional Preferente auf den CF Extremadura und stieg, während der ältere der beiden Klubs die Saison lediglich auf dem 17. Platz abschloss, als abermaliger Meister in die nächsthöhere Tercera División auf. In der Tercera División 2009/10 spielte die Herrenmannschaft in der Gruppe 14, die Vereine aus der Extremadura umfasst. In dieser noch regionalen Gruppe rangierte der Klub im Endklassement der regulären Spielzeit mit 22 Punkten Rückstand auf den Gruppensieger CD Badajoz und zehn Punkten Rückstand auf den Zweitplatzierten Jerez CF auf dem dritten Tabellenplatz. In den saisonabschließenden Aufstiegs-Play-offs schaffte es die Extremadura UD nur aufgrund der Auswärtstorregel von der ersten Runde in das Semifinale und von diesem ebenfalls nur aufgrund dieser Regel in die abschließende Finalrunde. In dieser setzte sich das Team im Hinspiel mit 4:2 gegen Atlético Mancha Real durch und war nach dem 0:0-Remis im Rückspiel einer der Aufsteiger aus der vierthöchsten spanischen Fußballliga in die dritthöchste des Landes. Am Ende derselben Spielzeit wurde der in der fünften Liga vertretene CF Extremadura, der zuletzt nur mehr von der Gemeinde Almendralejo und somit von der öffentlichen Hand gehalten wurde, endgültig aufgelöst.

Fünf Jahre in der Tercera División und erste Pokalteilnahme
Unter Trainer Juan Marrero Roig, der die Mannschaft auch bereits 2009/10 betreute, und dessen Nachfolger José Diego Pastelero, sowie Raúl Procopio, der das Traineramt Anfang März 2011 übernahm, nahm der Verein an der Segunda División B 2010/11 teil. Gleichzeitig hatte es der zweite Klub aus Almendralejo, Atlético San José Promesas, in die Viertklassigkeit geschafft und nahm ab dieser Spielzeit erstmals mit einer Herrenmannschaft in der Gruppe 14 der Tercera División teil. In der Segunda División B konnte man sich jedoch nicht halten und stieg als 19. und damit Vorletzter der Gruppe 1 direkt wieder in die Tercera División ab. In den nächsten Spielzeiten spielte der Verein immer vorne mit, hatte er aber auch in dieser Zeit etliche Trainerwechsel zu verzeichnen. Auch Raúl Procopio folgte im Sommer mit Agustín Izquierdo der am längsten amtierende Trainer der Extremadura UD. Unter ihm erreichte der Klub im Endklassement der Gruppe 14 der Tercera División der Saison 2011/12 den dritten Tabellenplatz und qualifizierte sich durch diesen für die meisterschaftsentscheidenden Aufstiegs-Play-offs. Nach einem Gesamtergebnis von 2:1 über Haro Deportivo (2:0 und 0:1) und einem Gesamtscore von 4:2 über Espanyol Barcelona B (2:1 und 2:1) schaffte es die Mannschaft in die über den Aufstieg in die dritte Liga oder den Verbleib in der vierten Liga entscheidende Finalrunde. In diesem unterlag Extremadura zuerst im Hinspiel gegen Atlético Sanluqueño mit 0:1 und verlor daraufhin auch das anschließende Rückspiel mit 2:1, was den Verbleib in der Tercera División bedeutete.

2012/13 gelang unter Agustín Izquierdo sogar der erste Platz am Ende der regulären Spielzeit in der Gruppe 14 der Tercera División mit neun Punkten Vorsprung auf den Verfolger Badajoz UD (nicht zu verwechseln mit dem einstigen Profiklub CD Badajoz, der in dieser Saison gerade den Neustart in der spanischen Sechstklassigkeit wagte). In den anschließenden Aufstiegs-Play-offs der Gruppensieger scheiterte Extremadura, nach knappen Ergebnissen gegen den CD Toledo und den FC Utebo, im Halbfinale der normalen Aufstiegs-Play-offs ebenfalls mit einem knappen Gesamtscore von 2:2 aufgrund der Auswärtstorregel gegen die B-Mannschaft des FC Granada und musste abermals in der vierthöchsten spanischen Fußballliga verblieben. Das Rückspiel gegen Granada, das in einem 2:1-Sieg von Extremadura endete, fand vor einer historischen Kulisse von über 6.000 Zuschauern im heimischen Estadio Francisco de la Hera statt. Nach dem neuerlichen verpassten Aufstieg verließ Izquierdo den Verein; auf den Trainerposten folgte ihm José Luis Diezma, der zuletzt zwei Jahre lang als Trainer bei Real Ávila tätig war und mit dem Klub in der Saison 2012/13 erstmals am spanischen Fußballpokal teilnahm. Diezma wurde jedoch nach etwas mehr als zwei Monaten im Amt wieder beurlaubt und durch Adolfo Muñoz. Während Diezma mit der Mannschaft vier Pflichtspiele in Folge verloren hatte (darunter fiel auch die erstmalige Teilnahme der Extremadura UD am spanischen Fußballpokal, als die Mannschaft in der ersten Runde der Copa del Rey 2013/14 mit 1:2 gegen den Drittligisten Albacete Balompié unterlag) agierte Muñoz zwar erfolgreicher, erreichte mit dem Team im Endklassement 2013/14 jedoch auch nur einen sechsten Platz in der abermals um Startplatz erweiterten Gruppe 14 der Tercera División.

In der Saison 2014/15, vor Beginn dieser der Präsident Diego Madera zurückgetreten war, übernahm das Traineramt Francisco Javier Diosdado García, genannt Cisqui. Dieser wurde jedoch noch während der laufenden Saison im April 2015 durch den altbekannten Juan Marrero Roig ersetzt. Unter Roig erreichte die Mannschaft in der wieder auf 20 Team reduzierten Gruppe 14 hinter dem Erzrivalen Mérida AD noch einen zweiten Tabellenplatz am Ende der regulären Spielzeit und scheiterte ein weiteres Mal an den Aufstiegs-Play-offs; diesmal bereits im Halbfinale. Der erneute Aufstieg in die dritthöchste Liga gelang allerdings erst 2016 wieder. Juan Marrero Roig führte seine Mannschaft in der Tercera División 2015/16 zum Gruppensieg in einem dicht gestaffelten obersten Tabellenfünftel. Als Gruppensieger nahm Extremadura daraufhin am Aufstiegs-Play-off der Gruppensieger teil und bezwang die UB Conquense nach einem 0:0 im Hinspiel mit 2:0 im Rückspiel, was den neuerlichen Aufstieg in die drittklassige spanische Segunda División B bedeutete.

Rückkehr in die Segunda División B und Aufstieg in die Zweitklassigkeit
Nach dem Aufstieg trennte sich die Vereinsführung von Juan Marrero Roig als Trainer und engagierte den erst 28-Jährigen Diego Merino als neuen Cheftrainer. Dieser saß in insgesamt zehn Pflichtspielen der Extremadura UD auf der Ersatzbank und musste den Verein Mitte Oktober bereits wieder verlassen. Den Klub hatte er immerhin in die zweite Runde der Copa del Rey 2016/17 geführt, konnte aber ansonsten nur einen weiteren Sieg (1:0-Erfolg über Real Linense zwischen dem Erst- und Zweitrundenspiel im Pokal) verzeichnen und blieb mit dem Team bei den restlichen Partien sieglos. Bereits vor dem Beginn dieser Spielzeit hatte die Vereinsführung mit der Gruppe COINSA eine Vereinbarung getroffen, die den Verein in spätestens drei Jahren in den Profifußball bringen sollte, woraufhin der Verein im Winter 2016/17 von ebendieser aufgekauft wurde. Nachdem auch Merinos Nachfolger auf dem Trainerposten, der 39-jährige einstige spanische Nationalspieler Juan Velasco Damas, kläglich scheiterte und nach zwei Siege, zwei Unentschieden und sieben Niederlagen aus acht Ligaspielen Ende Dezember wieder seinen Arbeitsplatz räumen musste, erfolgte in besagter Winterpause der Umbruch im Verein. Insgesamt gab es 13 Neuverpflichtungen auf der Spielerseite, auch der Trainer und der Sportdirektor wurden ausgewechselt. Als neuer Trainer wurde der ehemalige Profispieler Juan Sabas, der bereits einige Jahre Erfahrung als Trainer vorzuweisen hatte, engagiert. Sabas blieb bis zum Saisonende und sollte der Mannschaft von den Abstiegsplätzen wegführen, was ihm schlussendlich mit einem 13. Platz im Endklassement auch gelang.

In der Vorbereitung auf die Spielzeit 2017/18 absolvierte die Herrenmannschaft der Extremadura UD anlässlich des zehnjährigen Bestehens des Vereins ein Freundschaftsspiel gegen den spanischen Erstligisten Betis Sevilla. Nachdem Juan Sabas den Verein im Sommer wieder verlassen hatte, übernahm Agustín Izquierdo, der bereits von 2011 bis 2013 über einen Zeitraum von zwei Jahren als Trainer des Teams fungierte, das Traineramt. Bereits Mitte Oktober wurde Izquierdo nach durchwegs ausgeglichenen neun Meisterschaftsspielen wieder von seinen Pflichten entbunden und durch Manolo Ruiz ersetzt. Auch für Ruiz war es nach 16 Meisterschaftsspielen wieder Zeit für einen Abgang; bis zu diesem Zeitpunkt hatte er es mit dem Team auf acht Siege, vier Unentschieden und vier Niederlagen gebracht; von seinen letzten fünf Ligaspielen im Amt gewann er nur mehr eines. Ihm folgte der einstige spanische Internationale und Starspieler Rafael Martín Vázquez, der jedoch selbst nach nur etwas mehr als zwei Monaten wieder seinen Platz räumen musste, nachdem er es auf lediglich drei Siege und zwei Remis aus elf Ligaspielen gebracht hatte. Als neuer Trainer wurde der im Sommer nach einem halben Jahr im Amt ausgeschiedene Juan Sabas vorgestellt. Sabas betreute die Mannschaft daraufhin in den letzten zwei Saisonspielen und erreichte dabei einen 2:0-Auswärtssieg im Derby gegen den Mérida AD und einen 5:0-Heimsieg über die zweite Mannschaft von Betis Sevilla im letzten Spiel der regulären Saison. Obwohl Extremadura in dieser Saison vier verschiedene Trainer hatte, hielt sich die Mannschaft stets im oberen Tabellenbereich und auf den Plätzen der Aufstiegs-Play-offs. In ebendiesen setzte sich Extremadura in der ersten Runde aufgrund der Auswärtstorregel gegen Deportivo Fabril durch und besiegte in weiterer Folge den CD Mirandés und den FC Cartagena. Nach dem 1:0-Sieg im Hinspiel gegen Cartagena reichte ein 0:0-Remis im Rückspiel am 24. Juni 2018 für den erstmaligen Aufstieg in die zweithöchste spanische Fußballliga, die Segunda División.

Segunda División
Für die erste Spielzeit in der Segunda División gab die Vereinsführung namhafte Neuverpflichtungen bekannt. Darunter der von der AD Alcorcón kommende und aus der Region stammende Torhüter Casto Espinosa Barriga, genannt Casto, der zuletzt beim RSC Anderlecht spielende Diego Capel oder der zuletzt auf Leihbasis beim Miami FC aktive Vincenzo Rennella. Ihr erstes Spiel in der zweithöchsten Fußballliga des Landes bestritt die Extremadura UD am 19. August 2018 und erreichte dabei ein 1:1-Remis auswärts bei Real Oviedo. Den ersten Pflichtspieltreffer in einem Profispiel von Extremadura erzielte Álex Barrera. In der Zweiten Hauptrunde der Copa del Rey 2018/19, für die die sich das Team aufgrund seiner Platzierung im Endklassement der Segunda División B 2017/18 qualifizierte, unterlag das Team am 12. September 2018 mit 0:1 gegen die AD Alcorcón. Nach dem Remis im ersten Saisonspiel folgten für Extremadura in der Liga vier Niederlagen, ehe am 22. September 2018 auswärts gegen Rayo Majadahonda, ebenfalls ein Neuaufsteiger, der erste Pflichtspielsieg (4:1) im Profifußball gefeiert werden konnte.

Am Ende der Saison 2019/20 stieg der Verein als Vorletzter in die Segunda División B ab.

Extremadura UD B
Am 21. Juni 2016 wurde die Extremadura UD B als zweite Herrenmannschaft und Reservemannschaft in den Verein eingegliedert. Gegründet wurde das Team bereits im Jahre 1986 als Atlético San José Promesas bzw. Club Atlético San José Promesas und spielte in den letzten Jahren in der spanischen Viertklassigkeit. Bereits bei der Gründung der Extremadura UD wurde eine Übernahme des Klubs diskutiert, ehe man sich doch dazu entschied, den Klub komplett neuzugründen. Nach einem 13. Platz in der Gruppe 14 der Tercera División in der Saison 2016/17 belegte die Mannschaft auch in der Spielzeit 2017/18 den 13. Rang im Endklassement.

Frauenfußball

Am 15. Juli 2017 wurde die 1995 CFF Puebla gegründete und 2008 nach Almendralejo umgezogene und dort als Extremadura FCF in Erscheinung getretene Frauenfußballmannschaft in die Extremadura UD eingegliedert. Nur drei Jahre später erfolgte jedoch wieder die Trennung und so verfügt der Klub seit 2020 über keine Frauenfußballsektion.

Spielstätte

Als Spielstätte dient der Extremadura UD das 1996 eröffnete Estadio Francisco de la Hera, das sich im Besitz der Gemeinde Almendralejo befindet.

Weblinks
 Offizielle Webpräsenz von Extremadura UD (spanisch)
 Extremadura UD in der La Fútbolteca (spanisch)

Einzelnachweise

Fußballverein in der Extremadura
Sport (Almendralejo)
Gegründet 2007


text:
The Nightcrawlers were an American garage rock band formed in Daytona Beach, Florida in 1965.

The group is best known for their hit single, "The Little Black Egg", which was written in 1965 for an Easter concert in which the band opened for The Beach Boys. The single ultimately reached number 85 on the national charts after its third re-release in 1967. The group released three other singles: "Cry," "A Basket of Flowers," and "I Don't Remember." The five original members were Tommy Ruger (drums); Rob Rouse (vocal,  tambourine); Charlie Conlon (bass, vocal); Sylvan Wells (lead guitar and harmonica); and Pete Thomason (rhythm guitar, vocal).

Their sound is described as sparse folk rock, popularized by The Byrds, The Beau Brummels, and other post-British Invasion mid-1960s bands. They released one album on Kapp Records, but the original lineup disbanded in 1966, before the final (and most popular) release of "The Little Black Egg." The reformed Nightcrawlers did one more single for Kapp, "My Butterfly" written by band members Sylvan Wells and Rick Hollinger, in a more hard rock vein and then disbanded. The original main songwriter, Charlie Conlon, later reformed the group under the name "Conlon and the Crawlers", although the group did not record after 1967. The group continued with different members including Marshall Letter and eventually disbanded in 1970. In 2000, a retrospective CD with 24 cuts by the original members was released by Big Beat/London, England.

Although the group never gained wide fame, the simple riff of "The Little Black Egg" made it a favorite cover for garage bands of each musical era since the 1960s. It was covered in the 1990s by The Lemonheads.  The Cars also covered "The Little Black Egg." On September 19, 2008, the world premier of the film Cracking The Egg: The Untold Story of The Nightcrawlers was held at the 6th annual Daytona Beach Film Festival. Outsider music specialist Irwin Chusid claimed that when he was a teen the record sparked his interest in "odd songs".

At the behest of Ajaye Agency in Cincinnati, Rick Hollinger reformed the Nightcrawlers in 1968 in Tallahassee, Florida, for the express purpose of taking them to Ohio because the song "Little Black Egg" was enjoying a resurgence.  Besides Rick, the group members were Gary Sockwell on drums, Eddie Everette on lead guitar and vocals, Rod Vaillancourt on keyboards and vocals and Steve Flacy on bass guitar.  They worked for years in a multi-state area but never issued additional recordings.  Rod Vaillancourt and Steve Flacy went on to work with Adrian Belew in a band called Sweetheart and Rod later recorded with Artimus Pyle.

Original drummer Tommy Ruger (born Thomas William Ruger on November 30, 1946) died from complications of diabetes in Port Orange, Florida on December 11, 2013. He was 67.

References

External links
Unterberger, Richie "[ The Nightcrawlers Biography]", Allmusic, Macrovision Corporation
Unterberger, Richie "[ The Little Black Egg album review]", Allmusic, Macrovision Corporation
Head Heritage review of "Little Black Egg"

American folk rock groups
Musical groups established in 1965
Musical groups disestablished in 1975
Musical groups from Florida
1965 establishments in Florida
1975 disestablishments in Florida


text:
Little Big Soldier () is a 2010 action comedy film directed by Ding Sheng and produced and written by Jackie Chan, also starring Chan and Leehom Wang. The film was produced with a budget of US$25 million and filmed between January and April 2009 at locations in Yunnan, China. According to Chan, the film was stuck in development hell for over 20 years.

Little Big Soldier takes place during the Warring States period of China. An old foot soldier (Chan) and a young general from a rival state (Wang) are the only survivors of a ruthless battle. The soldier decides to capture the general and bring him back to his own state in exchange for a reward.

Plot
The film is set in the 3rd century BC during the Warring States period of China. After a battle between the states of  Liang and Wey, only two men are left alive – a Liang foot soldier and a Wey general. The Soldier survived because he is an expert in playing dead, with a device protruding like an arrowhead strapped to his body for added realism.

The Soldier captures the wounded General, hoping to use him as a ticket to freedom – by handing an enemy general to the king of Liang, the Soldier can be honourably discharged from military service and return home to a peaceful life. The young General, though taken captive, is condescending towards the Soldier. The two men are often at loggerheads during the long and winding journey, but are forced to work together in order to survive in a variety of circumstances: being tricked by a singer who blames them for the war; being nearly killed by a bear in the woods; being attacked by a group of beggars; and being captured and enslaved by a group of Loufan warriors.

To make matters more complicated, the General is actually the crown prince of Wey. Prince Wen, the General's younger brother, is coveting the throne of Wey. When he learns that the General has survived the battle, he leads his men on a relentless attempt to hunt down and kill the General in order to secure his claim to the throne. Although they stand on opposing sides, the Soldier ends up siding with the General against Prince Wen.

The General and Prince Wen decide to cooperate when they are attacked by the Loufan warriors, whose leader is seeking revenge on Prince Wen for killing his wife earlier. At the end of the fight, Prince Wen commits suicide to appease the Loufan leader and tells the General that one of them needs to live in order to ensure the continuity of Wey.

In the end, the Soldier brings the General back to Liang, but changes his mind at the last minute and releases the General – after the General promises that Wey will not wage war on Liang for the next ten years if he becomes the king of Wey. Turning towards Liang, the Soldier is shocked to see that his home state has been conquered by the state of Qin. When Qin soldiers order him to surrender, the Soldier refuses so the Qin soldiers fire arrows at him. Still proudly holding up the Liang flag, the Soldier collapses and dies. The state of Wey ultimately surrenders to the state of Qin without a fight.

Cast

 Jackie Chan as the Soldier
 Leehom Wang as the General
 Steve Yoo as Prince Wen, the General's younger brother
 Du Yuming as Guard Wu, Prince Wen's bodyguard
 Lin Peng as the Singer
 Xu Dongmei as Loufan Yan, the Loufan leader's wife
 Jin Song as Loufan Wei, the Loufan leader
 Ken Lo as Guard Yong, Prince Wen's bodyguard
 Yu Rongguang as Deputy General Yu, a Wey deputy general executed by the General
 Wang Baoming as a Liang scout
 Wu Yue as a beggar
 Yuen Woo-ping as a Liang official

Production
Little Big Soldier was a joint production of China's Polybona Films and Hong Kong's JCE Movies Limited, a company set up by Jackie Chan in 2003. The film is notable for having been in production for over 20 years. Chan had wanted to perform in and write a comedic film that took place in a historical background since the 1980s, when Hong Kong action cinema was rising in prominence.

Casting
Chan originally had Daniel Wu in mind to play the part of the young general, but Chan disregarded that thought after realising that he had already filmed two movies earlier with Wu. Joan Lin, Chan's wife, suggested their son Jaycee Chan, but Chan was highly against it. Lin later suggested Leehom Wang, whom Chan agreed to immediately. Chan and Wang have remained close friends ever since, and went on to collaborate on numerous songs, movies, concerts, and official events.

Home media
In the United Kingdom, Little Big Soldier was one of 2011's top ten best-selling foreign-language films on physical home video formats, and the fourth best-selling Chinese film (below Ip Man 2, Ip Man and Confucius).

Video game
At a conference in Beijing on 20 November 2009, Jackie Chan announced, along with Universal Culture Limited and EURO WEBSOFT, that an MMO is being released to promote the film. Chan and Wang's characters in the game were also shown at the conference. On 26 January 2010, the MMO went online under the name FLASH Little Big Soldier (). It is free to play under an account subscription. However, the game is available only in Chinese.

See also
Jackie Chan filmography
Leehom Wang
The Girl and the General (1967)

References

External links

2010 films
2010 action comedy films
2010s adventure comedy films
Chinese action comedy films
Films directed by Ding Sheng
Films set in the Warring States period
Hong Kong action comedy films
Hong Kong buddy films
2010s Hong Kong films