✦ LIBER ✦

Time-rollback using logs in historical databases

✍ Scribed by N.L. Sarda

Book ID: 103969594
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 924 KB
Volume: 35
Category: Article
ISSN: 0950-5849
DOI: 10.1016/0950-5849(93)90054-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Exploration in the Minnelusa Sandstone u

Exploration in the Minnelusa Sandstone using a digital well log database

✍ Shier, Daniel E. 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 363 KB

Priority assignment in distributed real-

Priority assignment in distributed real-time databases using optimistic concurrency control

✍ Lam, K.-Y.; Lee, V.C.S.; Hung, S.L.; Kao, B.C.M. 📂 Article 📅 1997 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 738 KB

85% reduction in database development ti

85% reduction in database development time using standardized case report form components

✍ Edie Owens; Barbara E. Tardiff; John H. Alexander; L. Kristin Newby; Kristina N. 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 76 KB

Changes in suicide numbers in psychiatri

Changes in suicide numbers in psychiatric hospitals: an analysis using log-linear time-trend models

✍ F. Keller; M. Wolfersdorf 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 539 KB

[Lecture Notes in Computer Science] Data

[Lecture Notes in Computer Science] Database and Expert Systems Applications Volume 3588 || Query Expansion Using Web Access Log Files

✍ Andersen, Kim Viborg; Debenham, John; Wagner, Roland 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 195 KB

Dexa 2005, The 16th International Conference On Database And Expert Systems Applications, Was Held At The Copenhagen Business School, Copenhagen, Denmark, From August 22 To 26, 2005. The Success Of The Dexa Series Has Partly Been Due To The Way In Which It Has Kept Abreast Of Recent Developments By

Randomized Sorting in O(n log 

Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations

✍ Mikkel Thorup 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

A randomized sorting algorithm is presented, doing as described in the title. Implications of the techniques are discussed for dictionaries and priority queues.