Sciweavers

1497 search results - page 61 / 300
» Online Negative Databases
Sort
View
ICDE
2004
IEEE
139views Database» more  ICDE 2004»
14 years 11 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
SIGMOD
2005
ACM
74views Database» more  SIGMOD 2005»
14 years 10 months ago
Online B-tree Merging
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous availability and high performance requires that such mergi...
Xiaowei Sun, Rui Wang 0002, Betty Salzberg, Chendo...
ICPR
2008
IEEE
14 years 4 months ago
Online handwritten Bangla character recognition using HMM
We describe here a novel scheme for recognition of online handwritten basic characters of Bangla, an Indian script used by more than 200 million people. There are 50 basic charact...
Swapan K. Parui, Koushik Guin, Ujjwal Bhattacharya...
SIGMOD
2010
ACM
377views Database» more  SIGMOD 2010»
14 years 3 months ago
Online aggregation and continuous query support in MapReduce
MapReduce is a popular framework for data-intensive distributed computing of batch jobs. To simplify fault tolerance, the output of each MapReduce task and job is materialized to ...
Tyson Condie, Neil Conway, Peter Alvaro, Joseph M....
DGO
2003
153views Education» more  DGO 2003»
13 years 11 months ago
Improving Access to Large Volumes of Online Data
The Internet has recently become the medium of interaction with large volumes of data. Enterprises in the public and private sectors made their databases available over the Intern...
Egemen Tanin, Hanan Samet