Black humor plays a crucial role in fulfilling Langston Hughes's anti-racist purposes as an integral notion in his poetry.  Accordingly, translation(s) of his poetry are to benefit from the same indexes on the basis of equivalent effect principle. On this account, 33 black-humor-rich poems of Hughes, translated by Ahmad Shamloo, Yaghma Golruee and Hassan Fayyad, were selected to be analyzed con...

To support “Database as a service” (DaaS) in the cloud, the database system is expected to provide similar functionalities as in centralized DBMS such as efficient processing of ad hoc queries. The system must therefore support DBMS-like indexes, possibly a few indexes for each table to provide fast location of data distributed over the network. In such a distributed environment, the indexes ha...

This paper presents a processor group membership protocol designed to run on top of a local area network. The protocol maintains information about a selected group of stations that explicitly join the protocol by keeping a replica of a global membership table at every member. Additionally, the protocol guarantees that a given station always occupies the same entry in the table. As a result, tab...

Traditional machine learning classifications of HTML documents focus on features drawn from terms in the documents, the link structure of groups of documents, or a combination of both. These techniques attempt to generate topical classifications of documents, with the hopes of mirroring a human's classification of pages into subject areas, thus facilitating retrieval. This paper presents an alt...

Linear probing of a scatte r (or hash) table interpre ts each key or item (these terms are inte rchangea ble here) as a probe index into the table [1]. 1 Typically, a key is divided by the table size and the remainder is used for indexing. If the selected slot is empty, the item is not present. Should the slot contain some other key, eacl1 next highe r location is checked until the item is foun...

Column-oriented indexes—such as projection or bitmap indexes—are compressed by run-length encoding to reduce storage and increase speed. Sorting the tables improves compression. On realistic data sets, permuting the columns in the right order before sorting can reduce the number of runs by a factor of two or more. For many cases, we prove that the number of runs in table columns is minimized if...

IntroductIon Scientific databases and data warehouses store large amounts of data ith several tables and attributes. For instance, the Sloan Digital Sky Survey (SDSS) astronomical database contains a large number of tables with hundreds of attributes, which can be queried in various combinations (Papadomanolakis & Ailamaki, 2004). These queries involve many tables using binary operations, such ...