[كتاب][B] Fundamentos de bases de datos

A Silberschatz, HF Korth, S Sudarshan, FS Pérez… - 2002‏ - academia.edu
• Bases de datos relacionales (Capítulos 4 al 7). El Capítulo 4 se centra en el lenguaje
relacional orientado al usuario de mayor influencia: SQL. El Capítulo 5 cubre otros dos …

Dynamic page generation acceleration using component-level caching

A Datta - US Patent 6,622,168, 2003‏ - Google Patents
6,026,413 A 2/2000 Challenger et al.... 707/202 The preloader uses a cache replacement
manager to manage 6,055,572 A 4/2000 Saksena............... 709/224 the replacement of …

Optimizing bitmap indices with efficient compression

K Wu, EJ Otoo, A Shoshani - ACM Transactions on Database Systems …, 2006‏ - dl.acm.org
Bitmap indices are efficient for answering queries on low-cardinality attributes. In this article,
we present a new compression scheme called Word-Aligned Hybrid (WAH) code that makes …

An efficient bitmap encoding scheme for selection queries

CY Chan, YE Ioannidis - Proceedings of the 1999 ACM SIGMOD …, 1999‏ - dl.acm.org
Bitmap indexes are useful in processing complex queries in decision support systems, and
they have been implemented in several commercial database systems. A key design …

On the performance of bitmap indices for high cardinality attributes

K Wu, E Otoo, A Shoshani - VLDB, 2004‏ - books.google.com
It is well established that bitmap indices are efficient for read-only attributes with low attribute
cardinalities. For an attribute with a high cardinality, the size of the bitmap index can be very …

Flash-Cosmos: In-flash bulk bitwise operations using inherent computation capability of nand flash memory

J Park, R Azizi, GF Oliveira… - 2022 55th IEEE/ACM …, 2022‏ - ieeexplore.ieee.org
Bulk bitwise operations, ie, bitwise operations on large bit vectors, are prevalent in a wide
range of important application domains, including databases, graph processing, genome …

Compressing bitmap indexes for faster search operations

K Wu, EJ Otoo, A Shoshani - Proceedings 14th international …, 2002‏ - ieeexplore.ieee.org
We study the effects of compression on bitmap indexes. The main operations on the bitmaps
during query processing are bitwise logical operations. Using the general purpose …

MIL primitives for querying a fragmented world

PA Boncz, ML Kersten - The VLDB Journal, 1999‏ - Springer
In query-intensive database application areas, like decision support and data mining,
systems that use vertical fragmentation have a significant performance advantage. In order …

[PDF][PDF] High-dimensional OLAP: A minimal cubing approach

X Li, J Han, H Gonzalez - … of the Thirtieth international conference on Very …, 2004‏ - vldb.org
Data cube has been playing an essential role in fast OLAP (online analytical processing) in
many multi-dimensional data warehouses. However, there exist data sets in applications like …

Methods of organizing data and processing queries in a database system, and database system and software product for implementing such methods

EO Koskas - US Patent 6,633,883, 2003‏ - Google Patents
US6633883B2 - Methods of organizing data and processing queries in a database system,
and database system and software product for implementing such methods - Google Patents …