Skip to end of metadata
Go to start of metadata

You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 7 Next »

This page addresses issues related to naming and indexing objects in RAMCloud. In other words, what are the various mechanisms an application can use to retrieve objects stored in RAMCloud? The choices fall into three general classes:

  • Naming: each object has a unique identifying name, such as a 128-bit global identifier, or a multi-part name such as (application identifier) + (table identifier) + (primary key). The name-based lookup returns either zero objects or one object.
  • Indexing: the system may provide separate structures that allow objects to be located quickly based on their contents, e.g. "find all student records for students who have grade point averages greater than 3.0". An indexed lookup can return any number of objects.
  • Search: return a collection of objects whose contents match a given set of criteria, which can be simple or general. The difference between search and indexing is not very crisp, but search is likely to be more flexible in the criteria that can be specified, but it may require scanning every element (for some definition of "every"), whereas indexing typically implies a table that makes lookups fast.

Naming

Assuming each object has a unique name, what form might that name take and what advantages and disadvantages are associated with that form?

  • Single global identifier: large flat namespace with all objects for all applications in the same namespace.
    • Looks simple and clean.
    • Too unstructured; leaves too many problems to be solved by higher-level software, doesn't provide enough hooks for management.
    • For example, need to be able to delete all data associated with an application.
    • Need to associate access control information with every object.
    • Result: system will have to create additional structures for this extra information; why not just design those structures in from the beginning?
    • Lookups may be tricky: when an application starts up, how does it locate its own data? Certain identifiers reserved for special purposes?
    • Are there any advantages to this approach?
  • Hierarchical name, such as (application id) + (table id) + (record id).
    • Provides natural places to store metadata.
    • Can reserve application id 0 for system information, table id 0 in each application for overall application information, etc.
    • What is the right number of levels?

How are names assigned?

  • Large namespace, clients generate unique identifiers (e.g., based on id of creating m achine).
  • Server generates names. For example, with hierarchical names, server assigns record ids consecutively starting at 1.
    • This introduces potential synchronization issues for the server.
    • Consecutive integer assignment can be useful: for example, easy to implement log-like tables where order of insertion is clear. Might also be useful for implementing message queues in tables.

Indexing

One possibility: no indexing provided by RAMCloud

  • RAMCloud provides only name-based lookups?
  • Implement indexing as a service or library on top of RAMCloud.
  • However, virtually every application will need some kind of indexing; probably better to build it into RAMCloud.
  • Also, RAMCloud will need indexing itself (e.g., find the application named "Facebook").
  • Indexing may be expensive to implement outside RAMCloud:
    • Multiple RPCs to traverse an index tree to find particular objects.
    • Consistency: maintaining index as tables are modified.

Suppose RAMCloud implements indexing; a minimal approach is to separate the management of the indexes from the generation of index keys:

  • Each table can have one or more named indexes associated with it.
  • An index maps from a key to one or more object identifiers.
  • An index knows nothing about the actual objects and never touches them; it deals exclusively in keys and object identifiers, which are provided to it.
  • Indexes take two forms:
    • Exact match (based on hash table)
    • Ordered (based on trees, with keys that can be strings, integers, or floating-point numbers)
      • Provide an extension mechanism for custom comparison functions?
  • Operations:
    • addIndexEntry(objectId, index, key)
      • Creates a new entry in an index associated with a particular table.
      • "index" name and index associated with objectId's table.
      • "key" is the value associated with this index entry (string, integer, etc.)
    • findEntries(table, index, key1, key2)
      • Returns object identifiers for all objects in a particular index for a particular table whose keyis in the range between "key1" and "key2".
      • May want additional options to exclude endpoints of range (or, just filter on the client side?).
    • deleteEntry(table, index, key)
  • With this approach, indexing is explicit:
    • The application must explicitly request the creation of an index entry, either
      at the same time that it creates/updates the corresponding object, or in a separate operation.
    • The application must also explicitly request the deletion of an index entry when it believes the corresponding object.
    • The keys used for indexes need not necessarily consist of data fields from the objects in the table, and not every object in a table necessarily must be indexed.
  • This approach makes indexes almost completely separate from objects:
    • No need for them to be stored in the same place, for example.
    • But, can't store the objects inline in the index, so an additional RPC will be required to fetch the objects once the index has returned their identifiers.
    • May not be able to guarantee consistency between index and table.

Other possible approaches to indexing:

  • Traditional SQL approach:
    • Indexes are defined in terms of fields stored in a table.
    • RAMCloud automatically maintains indexes once defined.
    • RAMCloud must parse objects in a table in order to extract fields for indexing.
    • This may be more transparent than the approach above; on the other hand, a client-level library may be able to manage indexes just as transparently as this, but using the approach above.
    • Requires the server to parse objects, which seems undesirable.
  • Same as "minimal" approach, but allow a "primary" index for table, with the objects guaranteed to be co-located on the same server as the index.
    • The index would provide a form that returns objects as well as identifiers.
    • No need for clustered indexes, where the objects are stored as part of the index: since everything is in RAM, prisoner with a server can retrieve the object extremely quickly once it knows its identifier.
    • If our RPCs are fast enough, do we need to worry about this optimization?

Distributed System Issues

There are several issues that arise because applications run on different machines from the servers, and because there could be thousands of servers; data for a particular application or even a particular table may spread across multiple servers. This section assumes that object names are application-table-id

How does the client know which server to ask for an object, given its identifier?

Miscellaneous Notes

  • No labels