Sciweavers

2057 search results - page 323 / 412
» Scalable and Structured Scheduling
Sort
View
ICDE
2008
IEEE
130views Database» more  ICDE 2008»
16 years 4 months ago
Efficient Computation of Diverse Query Results
We study the problem of efficiently computing diverse query results in online shopping applications, where users specify queries through a form interface that allows a mix of stru...
Erik Vee, Utkarsh Srivastava, Jayavel Shanmugasund...
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
16 years 4 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
224
Voted
ICDE
2004
IEEE
139views Database» more  ICDE 2004»
16 years 4 months ago
Engineering a Fast Online Persistent Suffix Tree Construction
Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of ...
Srikanta J. Bedathur, Jayant R. Haritsa
ICDE
2004
IEEE
125views Database» more  ICDE 2004»
16 years 4 months ago
Range CUBE: Efficient Cube Computation by Exploiting Data Correlation
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ahmed...
DAC
2008
ACM
16 years 4 months ago
Modeling of failure probability and statistical design of spin-torque transfer magnetic random access memory (STT MRAM) array fo
: Spin-Torque Transfer Magnetic RAM (STT MRAM) is a promising candidate for future universal memory. It combines the desirable attributes of current memory technologies such as SRA...
Jing Li, Charles Augustine, Sayeef S. Salahuddin, ...