Sciweavers

1567 search results - page 155 / 314
» Compressing Relations and Indexes
Sort
View
147
Voted
CEC
2009
IEEE
15 years 11 months ago
Evolving hypernetwork models of binary time series for forecasting price movements on stock markets
— The paper proposes a hypernetwork-based method for stock market prediction through a binary time series problem. Hypernetworks are a random hypergraph structure of higher-order...
Elena Bautu, Sun Kim, Andrei Bautu, Henri Luchian,...
ICESS
2007
Springer
15 years 11 months ago
An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash Memory
Recently, NAND flash memory has been used for a storage device in various mobile computing devices such as MP3 players, mobile phones and laptops because of its shock-resistant, lo...
Hyun-Seob Lee, Sangwon Park, Ha-Joo Song, Dong-Ho ...
SIGIR
2006
ACM
15 years 11 months ago
Information graphics: an untapped resource for digital libraries
Information graphics are non-pictorial graphics such as bar charts and line graphs that depict attributes of entities and relations among entities. Most information graphics appea...
Sandra Carberry, Stephanie Elzer, Seniz Demir
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
15 years 9 months ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...
SIGMOD
1999
ACM
98views Database» more  SIGMOD 1999»
15 years 9 months ago
Integration of Spatial Join Algorithms for Processing Multiple Inputs
Several techniques that compute the join between two spatial datasets have been proposed during the last decade. Among these methods, some consider existing indices for the joined...
Nikos Mamoulis, Dimitris Papadias