skip to main content
research-article
Open access

A Call to Arms: Long anticipated, the arrival of radically restructured database architectures is now finally at hand.

Published: 01 April 2005 Publication History

Abstract

We live in a time of extreme change, much of it precipitated by an avalanche of information that otherwise threatens to swallow us whole. Under the mounting onslaught, our traditional relational database constructs—always cumbersome at best—are now clearly at risk of collapsing altogether. In fact, rarely do you find a DBMS anymore that doesn’t make provisions for online analytic processing. Decision trees, Bayes nets, clustering, and time-series analysis have also become part of the standard package, with allowances for additional algorithms yet to come. Also, text, temporal, and spatial data access methods have been added—along with associated probabilistic logic, since a growing number of applications call for approximated results. Column stores, which store data column-wise rather than record-wise, have enjoyed a rebirth, mostly to accommodate sparse tables, as well as to optimize bandwidth.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Queue
Queue  Volume 3, Issue 3
Databases
April 2005
49 pages
ISSN:1542-7730
EISSN:1542-7749
DOI:10.1145/1059791
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 2005
Published in QUEUE Volume 3, Issue 3

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article
  • Popular
  • Editor picked

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2,050
  • Downloads (Last 6 weeks)210
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2008)A tribute, not a memorialACM SIGMOD Record10.1145/1379387.137939237:2(19-20)Online publication date: 1-Jun-2008
  • (2007)Design and Implementation of JSwitchProceedings of the International Conference on Information Technology10.1109/ITNG.2007.67(457-462)Online publication date: 2-Apr-2007
  • (2006)Contest of XML lock protocolsProceedings of the 32nd international conference on Very large data bases10.5555/1182635.1164219(1069-1080)Online publication date: 1-Sep-2006
  • (2006)Twig Query Processing Under Concurrent UpdatesProceedings of the 22nd International Conference on Data Engineering Workshops10.1109/ICDEW.2006.156Online publication date: 3-Apr-2006
  • (2006)Indexing for Dynamic Abstract RegionsProceedings of the 22nd International Conference on Data Engineering10.1109/ICDE.2006.81Online publication date: 3-Apr-2006
  • (2006)IEIPProceedings of the European Conference on Web Services10.1109/ECOWS.2006.24(201-210)Online publication date: 4-Dec-2006
  • (2006)Computational database technology applied to option pricing via finite differencesProceedings of the 10th East European conference on Advances in Databases and Information Systems10.1007/11827252_28(367-382)Online publication date: 3-Sep-2006

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Magazine Site

View this article on the magazine site (external)

Magazine Site

Login options

Full Access

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media