Skip to main content

Always Free Autonomous Oracle Database: Let's get going!

On September 16, Larry Ellison announced a new Always Free tier for Oracle Cloud, which (for me) most importantly includes an Always Free Autonomous Oracle Database.

For nothing but the "cost" of providing your credit card information (which is only used for identification purposes and is henceforth ignored until you decide to upgrade to a paid service), everyone in the world now can use the most powerful, most advanced database in the world FOR FREE.

Of course, there are limits. But oh my what generous limits they are!

Get lots more details here.

And it's not just the amazing Autonomous Database (in both transaction processing and data warehouse flavors).

You get Oracle Application Express (APEX) so you can build websites writing very little code, and taking full advantage of your SQL and PL/SQL skills.

You get SQL Developer to write what code you need and manage your database.

You get Oracle Rest Data Services to build REST endpoints against your database.

And if you happen to write in Python or Javascript (Node.js) or Java or....the drivers are also there for you. Wow!

Now, I must confess, I've never had trouble getting access too a free Oracle Database. I've been working for Oracle or Oracle partners since 1987. But running my own little database on my laptop for my own experiments is so different from having access to a self-managed database on the Internet that I can use to build my own websites.

Oh my - the ideas I have bubbling around in my head!

As some of you may know, I have gotten very concerned about climate change and human-caused extinctions. That's why I founded fabe - for all a beautiful earth - with Vincent Morneau last year. That's why we are building the fabe app to make it easy to reduce consumption and rescue species.

But I am also - more locally - somewhat obsessed with rescuing native trees and other living things from the human-driven scourge of invasive species. So I am starting up a Carrboro Tree Rescuers group here in town.
And now I can also easily build a website for this initiative.

And then even more personal, family-oriented websites to help us all stay connected.

And...and...

Well, what are you waiting for? Visit https://www.oracle.com/cloud/free/ and sign up now.

Comments

Popular posts from this blog

Quick Guide to User-Defined Types in Oracle PL/SQL

A Twitter follower recently asked for more information on user-defined types in the PL/SQL language, and I figured the best way to answer is to offer up this blog post. PL/SQL is a strongly-typed language . Before you can work with a variable or constant, it must be declared with a type (yes, PL/SQL also supports lots of implicit conversions from one type to another, but still, everything must be declared with a type). PL/SQL offers a wide array of pre-defined data types , both in the language natively (such as VARCHAR2, PLS_INTEGER, BOOLEAN, etc.) and in a variety of supplied packages (e.g., the NUMBER_TABLE collection type in the DBMS_SQL package). Data types in PL/SQL can be scalars, such as strings and numbers, or composite (consisting of one or more scalars), such as record types, collection types and object types. You can't really declare your own "user-defined" scalars, though you can define subtypes  from those scalars, which can be very helpful from the p

The differences between deterministic and result cache features

 EVERY once in a while, a developer gets in touch with a question like this: I am confused about the exact difference between deterministic and result_cache. Do they have different application use cases? I have used deterministic feature in many functions which retrieve data from some lookup tables. Is it essential to replace these 'deterministic' key words with 'result_cache'?  So I thought I'd write a post about the differences between these two features. But first, let's make sure we all understand what it means for a function to be  deterministic. From Wikipedia : In computer science, a deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the underlying machine always passing through the same sequence of states.  Another way of putting this is that a deterministic subprogram (procedure or function) has no side-effects. If you pass a certain set of arguments for the parameters, you will always get

How to Pick the Limit for BULK COLLECT

This question rolled into my In Box today: In the case of using the LIMIT clause of BULK COLLECT, how do we decide what value to use for the limit? First I give the quick answer, then I provide support for that answer Quick Answer Start with 100. That's the default (and only) setting for cursor FOR loop optimizations. It offers a sweet spot of improved performance over row-by-row and not-too-much PGA memory consumption. Test to see if that's fast enough (likely will be for many cases). If not, try higher values until you reach the performance level you need - and you are not consuming too much PGA memory.  Don't hard-code the limit value: make it a parameter to your subprogram or a constant in a package specification. Don't put anything in the collection you don't need. [from Giulio Dottorini] Remember: each session that runs this code will use that amount of memory. Background When you use BULK COLLECT, you retrieve more than row with each fetch,