Sciweavers

2001 search results - page 55 / 401
» Indexing in a Hypertext Database
Sort
View
ICIP
2001
IEEE
14 years 10 months ago
Color image coding, indexing and retrieval using binary space partitioning tree
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
Guoping Qiu, S. Sudirman
ICDE
2005
IEEE
149views Database» more  ICDE 2005»
14 years 10 months ago
Change Tolerant Indexing for Constantly Evolving Data
Index structures are designed to optimize search performance, while at the same time supporting efficient data updates. Although not explicit, existing index structures are typica...
Reynold Cheng, Yuni Xia, Sunil Prabhakar, Rahul Sh...
VLDB
1994
ACM
120views Database» more  VLDB 1994»
14 years 29 days ago
Indexing Multiple Sets
Index structures for multiple sets can be classified into those that group entries according to their key values and those that group entries according to their set membership. Th...
Christoph Kilger, Guido Moerkotte

Book
688views
15 years 7 months ago
Database Management Systems
A set of presentations covering the book, which includes the following topics ER Model and Conceptual Design, The Relational Model and SQL DDL, Relational Algebra, SQL, Database Ap...
Raghu Ramakrishnan, Johannes Gehrke
ICDE
2006
IEEE
98views Database» more  ICDE 2006»
14 years 10 months ago
Space-Partitioning Trees in PostgreSQL: Realization and Performance
Many evolving database applications warrant the use of non-traditional indexing mechanisms beyond B+-trees and hash tables. SP-GiST is an extensible indexing framework that broade...
Mohamed Y. Eltabakh, Ramy Eltarras, Walid G. Aref