Sciweavers

1724 search results - page 87 / 345
» Concurrency in the Data Warehouse
Sort
View
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
16 years 6 months ago
Mining reference tables for automatic text segmentation
Automatically segmenting unstructured text strings into structured records is necessary for importing the information contained in legacy sources and text collections into a data ...
Eugene Agichtein, Venkatesh Ganti
DASFAA
1999
IEEE
118views Database» more  DASFAA 1999»
15 years 10 months ago
Materialized View Maintenance Using Version Numbers
A data warehouse stores materialized views over data from one or more sources in order to provide fast access to the integrated data, regardless of the availability of the data so...
Tok Wang Ling, Eng Koon Sze
DEBU
2002
161views more  DEBU 2002»
15 years 6 months ago
Indexing and Retrieval of Historical Aggregate Information about Moving Objects
Spatio-temporal databases store information about the positions of individual objects over time. In many applications however, such as traffic supervision or mobile communication ...
Dimitris Papadias, Yufei Tao, Jun Zhang, Nikos Mam...
SPAA
2005
ACM
15 years 12 months ago
Concurrent cache-oblivious b-trees
This paper presents concurrent cache-oblivious (CO) B-trees. We extend the cache-oblivious model to a parallel or distributed setting and present three concurrent CO B-trees. Our ...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert...
RV
2010
Springer
110views Hardware» more  RV 2010»
15 years 4 months ago
Interval Analysis for Concurrent Trace Programs Using Transaction Sequence Graphs
Abstract. Concurrent trace programs (CTPs) are slices of the concurrent programs that generate the concrete program execution traces, where inter-thread event order specific to th...
Malay K. Ganai, Chao Wang