Sciweavers

2001 search results - page 207 / 401
» Indexing in a Hypertext Database
Sort
View
EDBT
2004
ACM
121views Database» more  EDBT 2004»
14 years 10 months ago
LexEQUAL: Supporting Multiscript Matching in Database Systems
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
A. Kumaran, Jayant R. Haritsa
ICDT
2005
ACM
131views Database» more  ICDT 2005»
14 years 3 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
VLDB
2004
ACM
93views Database» more  VLDB 2004»
14 years 3 months ago
Symmetric Relations and Cardinality-Bounded Multisets in Database Systems
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of...
Kenneth A. Ross, Julia Stoyanovich
SIGMOD
2007
ACM
179views Database» more  SIGMOD 2007»
14 years 10 months ago
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
Allison L. Holloway, Vijayshankar Raman, Garret Sw...
SIGMOD
2002
ACM
93views Database» more  SIGMOD 2002»
14 years 10 months ago
Implementing database operations using SIMD instructions
Modern CPUs have instructions that allow basic operations to be performed on several data elements in parallel. These instructions are called SIMD instructions, since they apply a...
Jingren Zhou, Kenneth A. Ross