EP4035047A1 - Obscurcissement de code à la demande de données dans un trajet d'entrée d'un service de mémorisation d'objets - Google Patents

Obscurcissement de code à la demande de données dans un trajet d'entrée d'un service de mémorisation d'objets

Info

Publication number
EP4035047A1
EP4035047A1 EP20786675.7A EP20786675A EP4035047A1 EP 4035047 A1 EP4035047 A1 EP 4035047A1 EP 20786675 A EP20786675 A EP 20786675A EP 4035047 A1 EP4035047 A1 EP 4035047A1
Authority
EP
European Patent Office
Prior art keywords
data
input data
code
execution
request
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
EP20786675.7A
Other languages
German (de)
English (en)
Inventor
Ramyanshu Datta
Timothy Lawrence Harris
Kevin C. Miller
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Amazon Technologies Inc
Original Assignee
Amazon Technologies Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US16/586,816 external-priority patent/US11386230B2/en
Priority claimed from US16/586,818 external-priority patent/US10996961B2/en
Priority claimed from US16/586,825 external-priority patent/US11023311B2/en
Application filed by Amazon Technologies Inc filed Critical Amazon Technologies Inc
Publication of EP4035047A1 publication Critical patent/EP4035047A1/fr
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F13/00Interconnection of, or transfer of information or other signals between, memories, input/output devices or central processing units
    • G06F13/14Handling requests for interconnection or transfer
    • G06F13/16Handling requests for interconnection or transfer for access to memory bus
    • G06F13/1668Details of memory controller
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22Indexing; Data structures therefor; Storage structures
    • G06F16/2228Indexing structures
    • G06F16/2272Management thereof
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/958Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/62Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6245Protecting personal data, e.g. for financial or medical purposes
    • G06F21/6254Protecting personal data, e.g. for financial or medical purposes by anonymising data, e.g. decorrelating personal data from the owner's identification
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/445Program loading or initiating
    • G06F9/44568Immediately runnable code
    • G06F9/44573Execute-in-place [XIP]
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • G06F2009/45579I/O management, e.g. providing access to device drivers or storage

Definitions

  • Computing devices can utilize communication networks to exchange data. Companies and organizations operate computer networks that interconnect a number of computing devices to support operations or to provide services to third parties.
  • the computing devices can be located in a single geographic location or located in multiple, distinct geographic locations (e.g., interconnected via private or public communication networks).
  • data centers or data processing centers herein generally referred to as a “data center,” may include a number of interconnected computing systems to provide computing resources to users of the data center.
  • the data centers may be private data centers operated on behalf of an organization or public data centers operated on behalf! or for the benefit of, the general public.
  • virtualization technologies allow a single physical computing device to host one or more instances of virtual machines that appear and operate as independent computing devices to users of a data center.
  • the single physical computing device can create, maintain, delete, or otherwise manage virtual machines in a dynamic manner.
  • users can request computer resources from a data center, including single computing devices or a configuration of networked computing devices, and be provided with varying numbers of virtual machine resources.
  • data centers provide a number of other beneficial services to client devices.
  • data centers may provide data storage services configured to store data submitted by client devices, and enable retrieval of that data over a network.
  • data storage services can be provided, often varying according to their input/output (I/O) mechanisms.
  • database services may allow I/O based on a database query language, such as the Structured Query Language (SQL).
  • SQL Structured Query Language
  • Block storage sendees may allow '" I/O based on modification to one or more defined- length blocks, in a manner similar to how an operating system interacts with local storage, and may thus facilitate virtualized disk drives usable, for example, to store an operating system of a virtual machine.
  • Object storage services may allow I/O at the level of individual objects or resources, such as individual files, which may vary in content and length.
  • an object storage sendee may provide an interface compliant with the Representational State Transfer (REST) architectural style, such as by allowing I/O based on calls designating input data and a hypertext transport protocol request method (e.g., GET, PUT, POST, DELETE, etc.) to be applied to that data.
  • REST Representational State Transfer
  • FIG. 1 is a block diagram depicting an illustrative environment in which an object storage service can operate in conjunction with an on-demand code execution system to implement functions in connection with input/output (I/O) requests to the object storage sendee;
  • I/O input/output
  • FIG. 2 depicts a general architecture of a computing device providing a frontend of the object storage sendee of FIG. 1 ;
  • FIG. 3 is a flow diagram depicting illustrative interactions for enabling a client device to modify an I/O path for the object storage sendee by insertion of a function implemented by execution of a task on the on-demand code execution system;
  • FIG. 4 is an illustrative visualization of a pipeline of functions to be applied to an I/O path for the object storage service of FIG. 1;
  • FIGS. 5A-5B show a flow diagram depicting illustrative interactions for handling a request to store input data as an object on the object storage service of FIG. 1, including execution of an owner-specified task to the input data and storage of output of the task as the object;
  • FIGS. 6A-6B show a flow' diagram depicting illustrative interactions for handling a request to retrieve data of an object on the object storage service of FIG. 1, including execution of an owner-specified task to the object and transmission of an output of the task to a requesting device as the object;
  • FIG. 7 is a flow chart depicting an illustrative routine for implementing owner- defined functions in connection with an I/O request obtained at the object storage service of FIG. 1 over an I/O path;
  • FIG. 8 is a flow chart depicting an illustrative routine for executing a task on the on-demand code execution system of FIG. 1 to enable data manipulations during implementation of an owner-defined function.
  • FIG. 9 is a flow chart depicting an illustrative routine for executing a task on the on-demand code execution system of FIG. 1 to execute first and second functions in response to store a data object provided in multiple portions.
  • FIG. 10 is a system diagram of illustrative data flows and interactions between various components of the service provider system in connection with the routine illustrated in FIG. 9
  • FIG. 11 is a flow chart depicting an illustrative routine for executing a task on the on-demand code execution system of FIG 1 to dynamically obfuscate portions of input data in response to store the input data.
  • FIG. 12 is a system diagram of illustrative data flows and interactions between various components of the service provider system in connection with the routine illustrated in FIG 11.
  • FIG. 13 is a flow chart depicting an illustrative routine for executing a task on the on-demand code execution system of FIG. 1 to dynamically determine and store an index of the contents of input data in response to a request to store the input data.
  • FIG. 14 is a system diagram of illustrative data flows and interactions between various components of the service provider system in connection with the routine illustrated in FIG 13.
  • aspects of the present disclosure relate to handling requests to read or write to data objects on an object storage system. More specifically, aspects of the present disclosure relate to modification of an input/output (I/O) path for an object storage service, such that one or more data manipulations can be inserted into the I/O path to modify the data to which a called request method is applied, without requiring a calling client device to specify such data manipulations.
  • data manipulations occur through execution of user-submitted code, which may be provided for example by an owner of a collection of data objects on an object storage system in order to control interactions with that data object.
  • an owner of an object collection wishes to ensure that end users do not submit objects to the collection including any personally identifying information (to ensure end user’s privacy)
  • the owner may submit code executable to strip such information from a data input.
  • the owner may further specify that such code should be executed during each write of a data object to the collection.
  • the code may be first executed against the input data, and resulting output data may be written to the collection as the data object.
  • data manipulations may occur on an on-demand code execution system, sometimes referred to as a serverless execution system.
  • on-demand code execution systems enable execution of arbitrary user-designated code, without requiring the user to create, maintain, or configure an execution environment (e.g., a physical or virtual machine) in which the code is executed.
  • an execution environment e.g., a physical or virtual machine
  • an on-demand code execution system may enable a user to submit code and may provide to the user an application programming interface (API) that, when used, enables the user to request execution of the code.
  • API application programming interface
  • the on-demand code execution system may generate an execution environment for the code, provision the environment with the code, execute the code, and provide a result.
  • an on-demand code execution system can remove a need for a user to handle configuration and management of environments for code execution.
  • Example techniques for implementing an on-demand code execution system are disclosed, for example, within U.S. Patent No. 9,323,556, entitled “PROGRAMMATIC EVENT DETECTION AND MESSAGE GENERATION FOR REQUESTS TO EXECUTE PROGRAM CODE,” and filed September 30, 2014 (the ‘“556 Patent”), the entirety of which is hereby incorporated by reference.
  • on-demand code execution system can be used to create a variety of network sendees.
  • a system could be used to create a “micro-sendee,” a network service that implements a small number of functions (or only one function), and that interacts with other services to provide an application.
  • the code executed to create such a service is often referred to as a “function” or a “task,” which can be executed to implement the service.
  • one technique for performing data manipulations within the I/O path of an object storage service may be to create a task on an on-demand code execution system that, when executed, performs the required data manipulation.
  • the task could provide an interface similar or identical to that of the object storage service, and be operable to obtain input data in response to a request method call (e.g., HTTP PUT or GET calls), execute the code of the task against the input data, and perform a call to the object storage sendee for implementation of the request method on resulting output data.
  • a request method call e.g., HTTP PUT or GET calls
  • end users might be required under this scenario to submit I/O requests to the on-demand code execution system, rather than the object storage service, to ensure execution of the task. Should an end user submit a call directly to the object storage service, task execution may not occur, and thus an owner would not be enabled to enforce a desired data manipulation for an object collection.
  • this technique may require that code of a task be authored to both provide an interface to end users that enables handling of calls to implement request methods on input data, and an interface that enables performance of calls from the task execution to the object storage service.
  • Implementation of these network interfaces may significantly increase the complexity of the required code, thus disincentivizing owners of data collections from using this technique.
  • user- submitted code directly implements network communication, that code may need to be varied according to the request method handled. For example, a first set of code may be required to support GET operations, a second set of code may be required to support PUT operations, etc. Because embodiments of the present disclosure relieve the user-submitted code of the requirement of handling network communications, one set of code may in some cases he enabled to handle multiple request methods.
  • embodiments of the present disclosure can enable strong integration of serverless task executions with interfaces of an object storage sendee, such that the sendee itself is configured to invoke a task execution on receiving an I/O request to a data collection.
  • generation of code to perform data manipulations may be simplified by configuring the object storage sendee to facilitate data input and output from a task execution, without requiring the task execution to itself implement network communications for I/O operations.
  • an object storage service and on-demand code execution system can be configured in one embodiment to “stage” input data to a task execution in the form of a handle (e.g., a POSIX-compliant descriptor) to an operating-system- level input/output stream, such that code of a task can manipulate the input data via defined- stream operations (e.g., as if the data existed within a local file system).
  • a handle e.g., a POSIX-compliant descriptor
  • This stream-level access to input data can be contrasted, for example, with network-level access of input data, which generally requires that code implement netwxirk communication to retrieve the input data.
  • the object storage service and on-demand code execution system can be configured to provide an output stream handle representing an output stream to which a task execution may write output.
  • the object storage service and on-demand code execution system may handle such writes as output data of the task execution, and apply a called request method to the output data.
  • a general-use on-demand code execution system may operate permissively with respect to network communications from a task execution, enabling any network communication from the execution unless such communication is explicitly denied.
  • This permissive model is reflective of the use of task executions as micro-services, winch often require interaction with a variety of other network services.
  • this permissive model also decreases security of the function, since potentially malicious network communications can also reach the execution in contrast to a permissive model, task executions used to perform data manipulations on an object storage system’s I/O path can utilize a restrictive model, whereby only explicitly-allowed network communications can occur from an environment executing a task.
  • a data collection owner may require only a single data manipulation to occur with respect to I/O to the collection. Accordingly, the object storage service may detect I/O to the collection, implement the data manipulation (e.g., by executing a serverless task within an environment provisioned with input and output handles), and apply the called request method to the resulting output data.
  • an owner may request multiple data manipulations occur with respect to an I/O path. For example, to increase portability and reusability, an owner may author multiple serverless tasks, which may be combined in different manners on different I/O paths. Thus, for each path, the owner may define a series of serverless tasks to be executed on I/O to the path.
  • an object storage system may natively provide one or more data manipulations.
  • an object storage system may natively accept requests for only portions of an object (e.g., of a defined byte range), or may natively enable execution of queries against data of an object (e.g., SQL queries).
  • any combination of various native manipulations and serverless task-based manipulations may be specified for a given I/O path.
  • an owner may specify that, for a particular request to read an object, a given SQL query be executed against the object, the output of which is processed via a first task execution, the output of which is processed via a second task execution, etc.
  • a particular path modification e.g., the addition of a pipeline
  • attributes of the path such as a client device from which an I/O request originates or an object or collection of objects within the request.
  • pipelines may be applied to individual objects, such that the pipeline is applied to all I/O requests for the object, or a pipeline may be selectively applied only when certain client devices access the object.
  • an object storage service may provide multiple I/O paths for an object or collection.
  • the same object or collection may be associated with multiple resource identifiers on the object storage sendee, such that the object or collection can be accessed through the multiple identifiers (e.g., uniform resource identifiers, or URIs), which illustratively correspond to different network-accessible endpoints.
  • different pipelines may be applied to each I/O path for a given object.
  • a first I/O path may be associated with unprivileged access to a data set, and thus be subject to data manipulations that remove confidential information from the data set prior during retrieval.
  • a second I/O path may be associated with privileged access, and thus not be subject to those data manipulations.
  • pipelines may be selectively applied based on other criteria. For example, whether a pipeline is applied may be based on time of day, a number or rate of accesses to an object or collection, etc.
  • embodiments disclosed herein improve the ability of computing systems, such as object storage systems, to provide and enforce data manipulation functions against data objects. Whereas prior techniques generally depend on external enforcement of data manipulation functions (e.g., requesting that users strip personal information before uploading it), embodiments of the present disclosure enable direct insertion of data manipulation into an I/O path for the object storage sy stem. Moreover, embodiments of the present disclosure provide a secure mechanism for implementing data manipulations, by providing for serverless execution of manipulation functions within an isolated execution environment.
  • Embodiments of the present disclosure further improve operation of serverless functions, by enabling such functions to operate on the basis of local stream (e.g., “file”) handies, rather than requiring that functions act as network-accessible services.
  • the presently disclosed embodiments therefore address technical problems inherent within computing systems, such as the difficulty of enforcmg data manipulations at storage systems and the complexity of creating external services to enforce such data manipulations.
  • These technical problems are addressed by the various technical solutions described herein, including the insertion of data processing pipelines into an I/O path for an object or object collection, potentially without knowledge of a requesting user, the use of serverless functions to perform aspects of such pipelines, and the use of local stream handles to enable simplified creation of serverless functions.
  • the present disclosure represents an improvement on existing data processing systems and computing systems in general.
  • the on-demand code execution system may provide a network-accessible sendee enabling users to submit or designate computer- executable source code to be executed by virtual machine instances on the on-demand code execution system.
  • Each set of code on the on-demand code execution system may define a “task,” and implement specific functionality corresponding to that task when executed on a virtual machine instance of the on-demand code execution system.
  • Individual implementations of the task on the on-demand code execution system may be referred to as an “execution” of the task (or a “task execution”).
  • the on-demand code execution system may enable users to directly trigger execution of a task based on a variety of potential events, such as transmission of an application programming interface (“API”) call to the on-demand code execution system, or transmission of a specially formatted hypertext transport protocol (“HTTP”) packet to the on-demand code execution system.
  • API application programming interface
  • HTTP hypertext transport protocol
  • the on-demand code execution system may further interact with an object storage system, in order to execute tasks during application of a data manipulation pipeline to an I/O path.
  • the on-demand code execution system can therefore execute any specified executable code “on-demand,” without requiring configuration or maintenance of the underlying hardware or infrastructure on which the code is executed.
  • the on-demand code execution system may be configured to execute tasks in a rapid manner (e.g., in under 100 milliseconds [ms]), thus enabling execution of tasks m “real-time” (e.g., with little or no perceptible delay to an end user).
  • the on-demand code execution system can include one or more virtual machine instances that are “pre-warmed” or pre-initiahzed (e.g., booted into an operating system and executing a complete or substantially comp!ete runtime environment) and configured to enable execution of user-defined code, such that the code may be rapidly executed in response to a request to execute the code, without delay caused by initializing the virtual machine instance.
  • the code corresponding to that task can be executed within a pre-mitialized virtual machine in a very short amount of time.
  • the on-demand code execution system described herein may maintain a pool of executing virtual machine instances that are ready for use as soon as a request to execute a task is received. Due to the pre-initialized nature of these virtual machines, delay (sometimes referred to as latency) associated with executing the task code (e.g., instance and language runtime startup time) can be significantly reduced, often to sub- 100 millisecond levels.
  • the on-demand code execution system may maintain a pool of virtual machine instances on one or more physical computing devices, where each virtual machine instance has one or more software components (e.g., operating systems, language runtimes, libraries, etc.) loaded thereon.
  • the on-demand code execution system may select a virtual machine instance for executing the program code of the user based on the one or more computing constraints related to the task (e.g., a required operating system or runtime) and cause the task to be executed on the selected virtual machine instance.
  • the tasks can be executed in isolated containers that are created on the virtual machine instances, or may be executed within a virtual machine instance isolated from other virtual machine instances acting as environments for other tasks.
  • the delay associated with finding compute capacity that can handle the requests can be significantly reduced.
  • virtual machine instance is intended to refer to an execution of software or other executable code that emulates hardware to provide an environment or platform on which software may execute (an example “execution environment”).
  • Virtual machine instances are generally executed by hardware devices, which may differ from the physical hardware emulated by the virtual machine instance.
  • a virtual machine may emulate a first type of processor and memory while being executed on a second type of processor and memory.
  • virtual machines can be utilized to execute software intended for a first execution environment (e.g., a first operating system) on a physical device that is executing a second execution environment (e.g., a second operating system).
  • hardware emulated by a virtual machine instance may be the same or similar to hardware of an underlying device.
  • a device with a first type of processor may implement a plurality of virtual machine instances, each emulating an instance of that first type of processor.
  • virtual machine instances can be used to divide a device into a number of logical sub-devices (each referred to as a “virtual machine instance”). While virtual machine instances can generally provide a level of abstraction away from the hard ware of an underlying physical device, this abstraction is not required. For example, assume a device implements a plurality of virtual machine instances, each of which emulate hardware identical to that provided by the device.
  • each virtual machine instance may allow a software application to execute code on the underlying hardware without translation, while maintaining a logical separation between software applications running on other virtual machine instances.
  • This process which is generally referred to as “native execution,” may be utilized to increase the speed or performance of virtual machine instances.
  • Other techniques that allow direct utilization of underlying hardware such as hardware pass-through techni ques, may be used, as well.
  • a virtual machine executing an operating system is described herein as one example of an execution environment, other execution environments are also possible.
  • tasks or other processes may be executed within a software “container,” which provides a runtime environment without itself providing virtualization of hardware.
  • Containers may be implemented within virtual machines to provide additional security, or may be run outside of a virtual machine instance.
  • FIG. 1 is a block diagram of an illustrative operating environment 100 in which a service provider system 110 operates to enable client devices 102 to perform I/O operations on objects stored within an object storage service 160 and to apply path modifications to such I/O operations, which modifications may include execution of user-defined code on an on- demand code execution system 120.
  • client devices 102 are shown in communication with the service provider system 110, including a desktop computer, laptop, and a mobile phone.
  • the client devices 102 can be any computing device such as a desktop, laptop or tablet computer, personal computer, wearable computer, server, personal digital assistant (PDA), hybrid PDA/mobile phone, mobile phone, electronic book reader, set-top box, voice command device, camera, digital media player, and the like.
  • PDA personal digital assistant
  • the object storage sendee 160 can operate to enable clients to read, write, modify, and delete data objects, each of which represents a set of data associated with an identifier (an “object identifier” or “resource identifier”) that can be interacted with as an individual resource.
  • an object may represent a single file submitted by a client device 102 (though the object storage sendee 160 may or may not store such an object as a single file).
  • This object-level interaction can be contrasted with other types of storage services, such as block-based storage services providing data manipulation at the level of individual blocks or database storage services providing data manipulation at the level of tables (or parts thereof) or the like.
  • the object storage service 160 illustratively includes one or more frontends 162, which provide an interface (a command-line interface (CLIs), application programing interface (APIs), or other programmatic interface) through which client devices 102 can interface with the service 160 to configure the service 160 on their behalf and to perform I/O operations on the service 160.
  • a client device 102 may interact with a frontend 162 to create a collection of data objects on the service 160 (e.g., a “bucket” of objects) and to configure permissions for that collection.
  • Client devices 102 may thereafter create, read, update, or delete objects within the collection based on the interfaces of the frontends 162.
  • the frontend 162 provides a REST-compliant HTTP interface supporting a variety of request methods, each of which corresponds to a requested I/O operation on the sendee 160.
  • request methods may include:
  • a LIST operation requesting listing of objects within an object collection stored on the service 160 by reference to an identifier of the collection.
  • the sendee 160 may provide a POST operation similar to a PUT operation but associated with a different upload mechanism (e.g., a browser-based HTML upload), or a HEAD operation enabling retrieval of metadata for an object without retrieving the object itself.
  • the service 160 may enable operations that combine one or more of the above operations, or combining an operation with a native data manipulation.
  • the service 160 may provide a COPY operation enabling copying of an object stored on the sendee 160 to another object, which operation combines a GET operation with a PUT operation.
  • the service 160 may provide a SELECT operation enabling specification of an SQL query to be applied to an object prior to returning the contents of that object, which combines an application of an SQL query to a data object (a native data manipulation) with a GET operation.
  • the service 160 may provide a “byte range” GET, which enables a GET operation on only a portion of a data object.
  • the operation requested by a client device 102 on the service 160 may be transmitted to the service via an HTTP request, which itself may include an HTTP method.
  • the HTTP method specified within the request may match the operation requested at the service 160.
  • the HTTP method of a request may not match the operation requested at the service 160.
  • a request may utilize an HTTP POST method to transmit a request to implement a SELECT operation at the service 160.
  • frontends 162 may be configured to obtain a call to a request method, and apply that request method to input data for the method.
  • a frontend 162 can respond to a request to PUT input data into the service 160 as an object by storing that input data as the object on the service 160.
  • Objects may be stored, for example, on object data stores 168, which correspond to any persistent or substantially persistent storage (including hard disk drives (HDDs), solid state drives (SSDs), network accessible storage (NAS), storage area networks (SANs), non-volatile random access memory (NVRAM), or any of a variety of storage devices known in the art).
  • the frontend 162 can respond to a request to GET an object from the service 160 by retrieving the object from the stores 168 (the object representing input data to the GET resource request), and returning the object to a requesting client device 102.
  • calls to a request method may invoke one or more native data manipulations provided by the service 160.
  • a SELECT operation may provide an SQL-formatted query to be applied to an object (also identified within the request), or a GET operation may provide a specific range of bytes of an object to be returned.
  • the sendee 160 illustratively includes an object manipulation engine 170 configured to perform native data manipulations, which illustratively corresponds to a device configured with software executable to implement native data manipulations on the sendee 160 (e.g., by- stripping non-seleeted bytes from an object for a byte-range GET, by applying an SQL query to an object and returning results of the query, etc.).
  • the service 160 can further be configured to enable modification of an I/O path for a given object or collection of objects, such that a called request method is applied to an output of a data manipulation function, rather than the resource identified within the call.
  • the sendee 160 may- enable a client device 102 to specify that GET operations for a given object should be subject to execution of a user-defined task on the on-demand code execution system 120, such that the data returned in response to the operation is the output of a task execution rather than the requested object.
  • the service 160 may enable a client device 102 to specify that PUT operations to store a given object should be subject to execution of a user-defined task on the on-demand code execution system 120, such that the data stored in response to the operation is the output of a task execution rather than the data provided for storage by a client device 102.
  • path modifications may include specification of a pipeline of data manipulations, including native data manipulations, task-based manipulations, or combinations thereof
  • a client device 102 may specify a pipeline or other data manipulation for an object or object collection through the frontend 162, which may store a record of the pipeline or manipulation in the I/O path modification data store 164, which store 164, like the object data stores 168, can represent any persistent or substantially persistent storage. While shown as distinct in FIG. 1, in some instances the data stores 164 and 168 may represent a single collection of data stores. For example, data modifications to objects or collections may themselves be stored as objects on the service 160.
  • the system further includes an on-demand code execution system 120.
  • the system 120 is solely usable by the object storage service 160 in connection with data manipulations of an I/O path.
  • the system 120 is additionally accessible by client devices 102 to directly implement serverless task executions.
  • the on-demand code execution system 120 may provide the service 160 (and potentially client devices 102) with one or more user interfaces, command-line interfaces (CLXs), application programing interfaces (APIs), or other programmatic interfaces for generating and uploading user-executable code (e.g., including metadata identifying dependency code objects for the uploaded code), invoking the user-provided code (e.g., submitting a request to execute the user codes on the on-demand code execution system 120), scheduling event- based jobs or timed jobs, tracking the user-provided code, or viewing other logging or monitoring information related to their requests or user codes.
  • CLXs command-line interfaces
  • APIs application programing interfaces
  • other programmatic interfaces for generating and uploading user-executable code (e.g., including metadata identifying dependency code objects for the uploaded code), invoking the user-provided code (e.g., submitting a request to execute the user codes on the on-demand code execution system 120), scheduling event- based jobs or timed
  • the client devices 102, object storage service 160, and on-demand code execution system 120 may communicate via a network 104, which may include any wired network, wireless network, or combination thereof.
  • the network 104 may be a personal area network, local area network, wide area network, over-the-air broadcast network (e.g., for radio or television), cable network, satellite network, cellular telephone network, or combination thereof.
  • the network 104 may be a publicly accessible network of linked networks, possibly operated by various distinct parties, such as the Internet.
  • the network 104 may be a private or semi-private network, such as a corporate or university intranet.
  • the network 104 may include one or more wireless networks, such as a Global System for Mobile Communications (GSM) network, a Code Division Multiple Access (CDMA) network, a Long Term Evolution (LTE) network, or any other type of wireless network.
  • GSM Global System for Mobile Communications
  • CDMA Code Division Multiple Access
  • LTE Long Term Evolution
  • the network 104 can use protocols and components for communicating via the Internet or any of the other aforementioned types of networks.
  • the protocols used by the network 104 may include Hypertext Transfer Protocol (HTTP), HTTP Secure (HTTPS), Message Queue Telemetry Transport (MQTT), Constrained Application Protocol (CoAP), and the like. Protocols and components for communicating via the Internet or any of the other aforementioned types of communication networks are well known to those skilled in the art and, thus, are not described in more detail herein.
  • the system 120 includes one or more frontends 130, which enable interaction with the on-demand code execution system 120.
  • the frontends 130 serve as a “front door” to the other services provided by the on-demand code execution system 120, enabling users (via client devices 102) or the sendee 160 to provide, request execution of, and view results of computer executable code.
  • the frontends 130 include a variety of components to enable interaction between the on-demand code execution system 120 and other computing devices.
  • each frontend 130 may include a request interface providing client devices 102 and the service 160 with the ability to upload or otherwise communication user- specified code to the on-demand code execution system 120 and to thereafter request execution of that code.
  • the request interface communicates with external computing devices (e.g., client devices 102, frontend 162, etc.) via a graphical user interface (GUI), CLI, or API
  • GUI graphical user interface
  • the frontends 130 process the requests and make sure that the requests are properly- authorized. For example, the frontends 130 may determine whether the user associated with the request is authorized to access the user code specified in the request.
  • references to user code as used herein may refer to any program code (e.g., a program, routine, subroutine, thread, etc.) written m a specific program language.
  • code e.g., a program, routine, subroutine, thread, etc.
  • program code may be used interchangeably.
  • Such user code may be executed to achieve a specific function, for example, m connection with a particular data transformation developed by the user.
  • Tasks individual collections of user code (e.g., to achieve a specific function) are referred to herein as “tasks,” while specific executions of that code (including, e.g., compiling code, interpreting code, or otherwise making the code executable) are referred to as “task executions” or simply “executions.” Tasks may be written, by way of non-limiting example, in JavaScript (e.g., nodejs), Java, Python, or Ruby (or another programming language).
  • the frontend 130 can include an execution queue, which can maintain a record of requested task executions.
  • the number of simultaneous task executions by the on-demand code execution system 120 is limited, and as such, new task executions initiated at the on-demand code execution system 120 (e.g., via an AIT call, via a call from an executed or executing task, etc.) may be placed on the execution queue and processed, e.g., in a first-in-first-out order.
  • the on-demand code execution system 120 may include multiple execution queues, such as individual execution queues for each user account.
  • users of the service provider system 110 may desire to limit the rate of task executions on the on-demand code execution system 120 (e.g., for cost reasons).
  • the on-demand code execution system 120 may utilize an account-specific execution queue to throttle the rate of simultaneous task executions by a specific user account.
  • the on-demand code execution system 120 may prioritize task executions, such that task executions of specific accounts or of specified priorities bypass or are prioritized within the execution queue.
  • the on- demand code execution system 120 may execute tasks immediately or substantially immediately after receiving a call for that task, and thus, the execution queue may be omited.
  • the frontend 130 can further include an output interface configured to output information regarding the execution of tasks on the on-demand code execution system 120.
  • the output interface may transmit data regarding task executions (e.g., results of a task, errors related to the task execution, or details of the task execution, such as total time required to complete the execution, total data processed via the execution, etc.) to the client devices 102 or the object storage service 160.
  • the on-demand code execution system 120 may include multiple frontends 130.
  • a load balancer may be provided to distribute the incoming calls to the multiple frontends 130, for example, in a round-robin fashion.
  • the manner in which the load balancer distributes incoming calls to the multiple frontends 130 may be based on the location or state of other components of the on- demand code execution system 120. For example, a load balancer may distribute calls to a geographically nearby frontend 130, or to a frontend with capacity to service the call.
  • each frontend 130 corresponds to an individual instance of another component of the on-demand code execution system 120, such as the active pool 148 described below; the load balancer may distribute calls according to the capacities or loads on those other components. Calls may in some instances be distributed between frontends 130 deterministically, such that a given call to execute a task will always (or almost always) be routed to the same frontend 130. This may, for example, assist in maintaining an accurate execution record for a task, to ensure that the task executes only a desired number of times. For example, calls may be distributed to load balance between frontends 130. Other distribution techniques, such as anycast routing, will be apparent to those of skill in the art.
  • the on-demand code execution system 120 further includes one or more worker managers 140 that manage the execution environments, such as virtual machine instances 150 (shown as VM instance 150A and 150B, generally referred to as a “VM”), used for servicing incoming calls to execute tasks. While the following will be described with reference to virtual machine instances 150 as examples of such environments, embodiments of the present disclosure may utilize other environments, such as software containers.
  • each worker manager 140 manages an active pool 148, which is a group (sometimes referred to as a pool) of virtual machine instances 150 executing on one or more physical host computing devices that are initialized to execute a given task (e.g , by having the code of the task and any dependency data objects loaded into the instance).
  • the instances 150 are described here as being assigned to a particular task, in some embodiments, the instances may be assigned to a group of tasks, such that the instance is tied to the group of tasks and any tasks of the group can be executed within the instance.
  • the tasks in the same group may belong to the same security group (e.g., based on their security credentials) such that executing one task in a container on a particular instance 150 after another task has been executed in another container on the same instance does not pose security risks.
  • a task may be associated with permissions encompassing a variety of aspects controlling how a task may execute. For example, permissions of a task may define what network connections (if any) can be initiated by an execution environmen t of the task.
  • permissions of a task may define what authentication information is passed to a task, controlling what network-accessible resources are accessible to execution of a task (e.g., objects on the service 160).
  • a security group of a task is based on one or more such permissions.
  • a security group may be defined based on a combination of permissions to initiate network connections and permissions to access network resources.
  • the tasks of the group may share common dependencies, such that an environment used to execute one task of the group can be rapidly modified to support execution of another task within the group.
  • each frontend 130 may be associated with a corresponding worker manager 140 (e.g., a worker manager 140 co- located or geographically nearby to the frontend 130) and thus, the frontend 130 may pass most or all requests to that worker manager 140.
  • a frontend 130 may include a location selector configured to determine a worker manager 140 to which to pass the execution request.
  • the location selector may determine the worker manager 140 to receive a call based on hashing the call, and distributing the call to a worker manager 140 selected based on the hashed value (e.g., via a hash ring).
  • Various other mechanisms for distributing calls between worker managers 140 will be apparent to one of skill in the art.
  • the worker manager 140 may modify a virtual machine instance 150 (if necessary) and execute the code of the task within the instance 150.
  • respective instances 150 may have operating systems (OS) 152 (shown as OS 152 A and 152B), language runtimes 154 (shown as runtime 154A and 154B), and user code 156 (shown as user code 156A and 156B).
  • OS operating systems
  • runtime 154A and 154B language runtimes 154
  • user code 156 shown as user code 156A and 156B
  • the OS 152, runtime 154, and user code 156 may collectively enable execution of the user code to implement the task.
  • tasks may be rapidly executed within an execution environment.
  • each VM 150 additionally includes staging code 157 executable to facilitate staging of input data on the VM 150 and handling of output data written on the VM 150, as well as a VM data store 158 accessible through a local file system of the VM 150.
  • the staging code 157 represents a process executing on the VM 150 (or potentially a host device of the VM 150) and configured to obtain data from the object storage service 160 and place that data into the VM data store 158.
  • the staging code 157 can further be configured to obtain data written to a file within the VM data store 158, and to transmit that data to the object storage service 160.
  • user code 156 is not required to obtain data over a network, simplifying user code 156 and enabling further restriction of network communications by the user code 156, thus increasing security. Rather, as discussed above, user code 156 may interact with input data and output data as files on the VM data store 158, by use of file handles passed to the code 156 during an execution. In some embodiments, input and output data may be stored as files within a kernel-space file system of the data store 158.
  • the staging code 157 may provide a virtual file system, such as a filesystem in userspace (FUSE) interface, which provides an isolated file system accessible to the user code 156, such that the user code’s access to the VM data store 158 is restricted.
  • a virtual file system such as a filesystem in userspace (FUSE) interface
  • FUSE filesystem in userspace
  • the term “local file system” generally refers to a file system as maintained within an execution environment, such that software executing within the environment can access data as file, rather than via a network connection.
  • the data storage accessible via a local file system may itself be local (e.g., local physical storage), or may be remote (e.g., accessed via a network protocol, like NFS, or represented as a virtualized block device provided by a network-accessible sendee).
  • a network protocol like NFS, or represented as a virtualized block device provided by a network-accessible sendee
  • the VM data store 158 can include any persistent or non-persistent data storage device.
  • the VM data store 158 is physical storage of the host device, or a virtual disk drive hosted on physical storage of the host device.
  • the VM data store 158 is represented as local storage, but is in fact a virtualized storage device provided by a network accessible service.
  • the VM data store 158 may be a virtualized disk drive provided by a network-accessible block storage service.
  • the object storage service 160 may be configured to provide file-level access to objects stored on the data stores 168, thus enabling the VM data store 158 to be virtualized based on communications between the staging code 157 and the service 160.
  • the object storage service 160 can include a file-level interface 166 providing network access to objects within the data stores 168 as files.
  • the file-level interface 166 may, for example, represent a network-based file system server (e.g., a network file system (NFS)) providing access to objects as files, and the staging code 157 may implement a client of that server, thus providing file-level access to objects of the service 160.
  • NFS network file system
  • the VM data store 158 may represent virtualized access to another data store executing on the same host device of a VM instance 150.
  • an active pool 148 may include one or more data staging VM instances (not shown in FIG. 1), which may be co-tenanted with VM instances 150 on the same host device.
  • a data staging VM instance may be configured to support retrieval and storage of data from the service 160 (e.g., data objects or portions thereof, input data passed by client devices 102, etc.), and storage of that data on a data store of the data staging VM instance.
  • the data staging VM instance may, for example, be designated as unavailable to support execution of user code 156, and thus be associated with elevated permissions relative to instances 150 supporting execution of user code.
  • the data staging VM instance may make this data accessible to other VM instances 150 within its host device (or, potentially, on nearby host devices), such as by use of a network- based file protocol, like NFS.
  • Other VM instances 150 may then act as clients to the data staging VM instance, enabling creation of virtualized VM data stores 158 that, from the point of view of user code 156A, appear as local data stores.
  • network-based access to data stored at a data staging VM can be expected to occur very quickly, given the co-location of a data staging VM and a VM instance 150 within a host device or on nearby host devices.
  • IO streams may additionally be used to read from or write to other interfaces of a VM instance 150 (while still removing a need for user code 156 to conduct operations other than stream-level operations, such as creating network connections).
  • staging code 157 may “pipe” input data to an execution of user code 156 as an input stream, the output of which may be “piped” to the staging code 157 as an output stream.
  • a staging VM instance or a hypervisor to a VM instance 150 may pass input data to a network port of the VM instance 150, which may be read- from by staging code 157 and passed as an input stream to the user code 157.
  • data written to an output stream by the task code 156 may be written to a second network port of the instance 150A for retrieval by the staging VM instance or hypervisor.
  • a hypervisor to the instance 150 may pass input data as data written to a virtualized hardware input device (e.g., a keyboard) and staging code 157 may pass to the user code 156 a handle to the IO stream corresponding to that input device.
  • the hypervisor may similarly pass to the user code 156 a handle for an IO stream corresponding to a virtualized hardware output device, and read data written to that stream as output data.
  • file streams may generally be modified to relate to any IO stream.
  • the object storage service 160 and on-demand code execution system 120 are depicted in FIG. 1 as operating in a distributed computing environment including several computer systems that are interconnected using one or more computer networks (not shown in FIG. 1).
  • the object storage service 160 and on-demand code execution system 120 could also operate within a computing environment having a fewer or greater number of devices than are illustrated in FIG. 1.
  • the on-demand code execution system 120 or various constituents thereof could implement various Web services components, hosted or “cloud” computing environments, or peer to peer network configurations to implement at least a portion of the processes described herein.
  • the object storage service 160 and on-demand code execution system 120 may be combined into a single service.
  • the object storage service 160 and on-demand code execution system 120 may be implemented directly in hardware or software executed by hardware devices and may, for instance, include one or more physical or virtual servers implemented on physical computer hardware configured to execute computer executable instructions for performing various features that will be described herein.
  • the one or more servers may be geographically dispersed or geographically co- located, for instance, in one or more data centers. In some instances, the one or more servers may operate as part of a system of rapidly provisioned and released computing resources, often referred to as a “cloud computing environment.”
  • the object storage sendee 160 and on-demand code execution system 120 are illustrated as connected to the network 104.
  • any of the components within the object storage service 160 and on-demand code execution system 120 can communicate with other components of the on-demand code execution system 120 via the network 104.
  • not all components of the object storage service 160 and on-demand code execution system 120 are capable of communicating with other components of the virtual environment 100.
  • only the frontends 130 and 162 (winch may in some instances represent multiple frontends) may be connected to the network 104, and other components of the object storage service 160 and on-demand code execution system 120 may communicate with other components of the environment 100 via the respective frontends 130 and 162.
  • While some functionalities are generally described herein with reference to an individual component of the object storage service 160 and on-demand code execution system 120, other components or a combination of components may additionally or alternatively implement such functionalities.
  • object storage service 160 is depicted in FIG. 1 as including an object manipulation engine 170, functions of that engine 170 may additionally or alternatively be implemented as tasks on the on-demand code execution system 120.
  • on-demand code execution system 120 is described as an example system to apply data manipulation tasks, other compute systems may be used to execute user-defined tasks, which compute systems may include more, fewer or different components than depicted as part of the on-demand code execution system 120.
  • the object storage service 160 may include a physical computing device configured to execute user-defined tasks on demand, thus representing a compute system usable in accordance with embodiments of the present disclosure.
  • the specific configuration of elements within FIG. 1 is intended to be illustrative.
  • FIG. 2 depicts a general architecture of a frontend server 200 computing device implementing a frontend 162 of FIG. I.
  • the general architecture of the frontend server 200 depicted in FIG. 2 includes an arrangement of computer hardware and software that may be used to implement aspects of the present disclosure.
  • the hardware may be implemented on physical electronic devices, as discussed in greater detail below.
  • the frontend server 200 may include many more (or fewer) elements than those shown in FIG. 2, It is not necessary, however, that all of these generally conventional elements be shown in order to provide an enabling disclosure. Additionally, the general architecture illustrated in FIG. 2 may be used to implement one or more of the other components illustrated in FIG. 1.
  • the frontend server 200 includes a processing unit 290, a network interface 292, a computer readable medium drive 294, and an mput/output device interface 296, all of which may communicate with one another by way of a communication bus.
  • the netw'ork interface 292 may provide connectivity to one or more networks or computing systems.
  • the processing unit 290 may thus receive information and instructions from other computing systems or services via the network 104.
  • the processing unit 290 may also communicate to and from primary memory 280 or secondary memory 298 and further provide output information for an optional display (not shown) via the input/output device interface 296.
  • the input/output device interface 296 may also accept input from an optional input device (not shown).
  • the primary memory 280 or secondary memory 298 may contain computer program instructions (grouped as units m some embodiments) that the processing unit 290 executes in order to implement one or more aspects of the present disclosure. These program instructions are shown in FIG. 2 as included within the primary memory 280, but may additionally or alternatively be stored within secondary memory 298.
  • the primary memory 280 and secondary memory 298 correspond to one or more tiers of memory devices, including (but not limited to) RAM, 3D XPOINT memory, flash memory, magnetic storage, and the like.
  • the primary memory 280 is assumed for the purposes of description to represent a main working memory of the worker manager 140, with a higher speed but lower total capacity than secondary memory 298.
  • the primary memory 280 may 7 store an operating system 284 that provides computer program instructions for use by the processing unit 290 in the general administration and operation of the frontend server 200.
  • the memory 280 may further include computer program in structions and other information for implementing aspects of the present disclosure.
  • the memory 280 includes a user interface unit 282 that generates user interfaces (or instructions therefor) for display upon a computing device, e.g , via a navigation or browsing interface such as a browser or application installed on the computing device.
  • the memory 280 may include a control plane unit 286 and data plane unit 288 each executable to implement aspects of the present disclosure.
  • the control plane unit 286 may include code executable to enable owners of data objects or collections of objects to attach manipulations, serverfess functions, or data processing pipelines to an I/O path, in accordance with embodiments of the present disclosure.
  • the control plane unit 286 may enable the frontend 162 to implement the interactions of FIG. 3.
  • the data plane unit 288 may illustratively include code enabling handling of I/O operations on the object storage service 160, including implementation of manipulations, serverless functions, or data processing pipelines attached to an I/O path (e.g., via the interactions of FIGS. 5A-6B, implementation of the routines of FIGS. 7-8, etc.).
  • the frontend server 200 of FIG. 2 is one illustrative configuration of such a device, of which others are possible.
  • a frontend server 200 may in some embodiments be implemented as multiple physical host devices.
  • a first device of such a frontend server 200 may implement the control plane unit 286, while a second device may implement the data plane unit 288.
  • FIG. 2 While described in FIG. 2 as a frontend server 200, similar components may be utilized in some embodiments to implement other devices shown m the environment 100 of FIG. 1.
  • a similar device may implement a worker manager 140, as described in more detail in U.S. Patent No. 9,323,556, entitled “PROGRAMMATIC EVENT DETECTION AND MESSAGE GENERATION FOR REQUESTS TO EXECUTE PROGRAM CODE,” and filed September 30, 2014 (the ‘“556 Patent”), the entirety of which is hereby incorporated by reference.
  • illustrative interactions are depicted for enabling a client device 102 A to modify an I/O path for one or more objects on an object storage service 160 by inserting a data manipulation into the I/O path, which manipulation is implemented within a task executable on the on-demand code execution system 120.
  • the interactions of FIG. 3 begin at (I), where the client device 102A authors the stream manipulation code.
  • the code can illustratively function to access an input file handle provided on execution of the program (which may, for example, be represented by the standard input stream for a program, commonly “stdin”), perform manipulations on data obtained from that file handle, and write data to an output file handle provided on execution of the program (which may, for example, by represented by the standard output stream for a program, commonly “stdout”).
  • IO operating- system-level mput/output
  • IO operating-system-level input/output stream
  • Streams may be created in various manners.
  • a programming language may generate a stream by use of a function library to open a file on a local operating system, or a stream may be created by use of a “pipe” operator (e.g., within an operating system shell command language).
  • a pipe e.g., within an operating system shell command language.
  • most general purpose programming languages include, as basic functionality of the code, the ability to interact with streams.
  • task code may be authored to accept, as a parameter of the code, an input handle and an output handle, both representing IO streams (e.g., an input stream and an output stream, respectively).
  • the code may then manipulate data of the input stream, and write an output to the output stream.
  • any of a variety of functions may be implemented according to the desires of the user. For example, a function may search for and remove confidential information from the input stream.
  • a function may search for and remove confidential information from the input stream.
  • other code may implement additional interfaces, such as network communication interfaces.
  • the need for the code to create such streams is removed.
  • streams may be created outside of the code, and potentially outside of an execution environment of the code, stream manipulation code need not necessarily be trusted to conduct certain operations that may be necessary to create a stream.
  • a stream may represent information transmitted over a network connection, without the code being provided with access to that network connection.
  • the code may be authored in a variety of programming languages. Authoring tools for such languages are known in the art and thus will not be described herein. While authoring is described m FIG. 3 as occurring on the client device 102A, the service 160 may in some instances provide interfaces (e.g., web GUIs) through which to author or select code.
  • interfaces e.g., web GUIs
  • the client device 102A submits the stream manipulation code to the frontend 162 of the service 160, and requests that an execution of the code be inserted into an I/O path for one or more objects.
  • the frontends 162 may provide one or more interfaces to the device 102A enabling submission of the code (e.g., as a compressed file).
  • the frontends 162 may further provide interfaces enabling designation of one or more I/O paths to which an execution of the code should be applied.
  • Each I/O path may correspond, for example, to an object or collection of objects (e.g., a “bucket” of objects).
  • an I/O path may further corresponding to a given way of accessing such object or collection (e.g., a URI through which the object is created), to one or more accounts attempting to access the object or collection, or to other path criteria. Designation of the path modification is then stored in the I/O path modification data store 164, at (3). Additionally, the stream manipulation code is stored within the object data stores 166 at (4).
  • the service 160 when an I/O request is received via the specified I/O path, the service 160 is configured to execute the stream manipulation code against input data for the request (e.g., data provided by the client device 102 A or an object of the service 160, depending on the I/O request), before then applying the request to the output of the code execution.
  • input data for the request e.g., data provided by the client device 102 A or an object of the service 160, depending on the I/O request
  • a client device 102 A (which in FIG. 3 illustratively represents an owner of an object or object collection) can obtain greater control over data stored on and retrieved from the object storage seance 160.
  • the interactions of FIG. 3 generally relate to insertion of a single data manipulation into the I/O path of an object or collection on the seance 160.
  • an owner of an object or collection is enabled to insert multiple data manipulations into such an I/O path.
  • Each data manipulation may correspond, for example, to a serverless code-based manipulation or a native manipulation of the seance 160.
  • an owner has submitted a data set to the seance 160 as an object, and that the owner wishes to provide an end user with a filtered view of a portion of that data set. While the owner could store that filtered view of the portion as a separate object and provide the end user with access to that separate object, this results in data duplication on the service 160.
  • the owner wishes to provide multiple end users with different portions of the data set, potentially with customized filters, that data duplication grows, resulting in significant inefficiencies.
  • another option may be for the owner to author or obtain custom code to implement different filters on different portions of the object, and to insert that code into the I/O path for the object.
  • this approach may require the owner to duplicate some native functionality of the service 160 (e.g., an ability to retrieve a portion of a data set).
  • this approach would inhibit modularity and reusability of code, since a single set of code would be required to conduct two functions (e.g., selecting a portion of the data and filtering that portion).
  • FIG. 4 An illustrative visualization of such a pipeline is shown in FIG. 4 as pipeline 400.
  • the pipeline 400 illustrates a series of data manipulations that an owner specifies are to occur on calling of a request method against an object or object collection.
  • the pipeline begins with input data, specified within the call according to a called request method.
  • a PUT call may generally include the input data as the data to be stored
  • a GET call may generally include the input data by reference to a stored object.
  • a LIST call may specify a directory, a manifest of which is the input data to the LIST request method.
  • the called request method is not initially applied to the input data. Rather, the input data is initially passed to an execution of “code A” 404, where code A represents a first set of user-authored code. The output of that execution is then passed to “native function A” 406, which illustratively represents a native function of the service 160, such as a “SELECT” or byte-range function implemented by the object manipulation engine 170. The output of that native function 406 is then passed to an execution of “code B” 408, which represents a second set of user-authored code.
  • the output of that execution 408 is passed to the called request method 410 (e.g., GET, PUT, LIST, etc.).
  • the request method is applied to the output of the execution 408, which illustratively represents a transformation of the input data according to one or more owner- specified manipulations 412.
  • implementation of the pipeline 400 may not require any action or imply any knowledge of the pipeline 400 on the part of a calling client device 102. As such, implementation of pipelines can be expected not to impact existing mechanisms of interacting wath the service 160 (other than altering the data stored on or retrieved from the service 160 in accordance with the pipeline).
  • implementation of a pipeline can be expected not to require reconfiguration of existing programs utilizing an API of the service 160.
  • the service 160 may enable an owner to configure non-linear pipelines, such as by include conditional or branching nodes within the pipeline.
  • data manipulations e.g., serverless-based functions
  • a return value such as an indication of successful execution, encountering an error, etc.
  • the return value of a data manipulation may be used to select a conditional branch within a branched pipeline, such that a first return value causes the pipeline to proceed on a first branch, while a second return value causes the pipeline to proceed on a second branch.
  • pipelines may include parallel branches, such that data is copied or divided to multiple data manipulations, the outputs of which are passed to a single data manipulation for merging prior to executing the called method.
  • the sendee 160 may illustratively provide a graphical user interface through which owners can create pipelines, such as by specifying nodes within the pipeline and linking those nodes together via logical connections.
  • a variety of flow-based development interfaces are known and may be utilized in conjunction with aspects of the present disclosure.
  • a pipeline applied to a particular I/O path may be generated on-the-fly, at the time of a request, based on data manipulations applied to the path according to different criteria. For example, an owner of a data collection may apply a first data manipulation to all interactions with objects within a collection, and a second data manipulation to all interactions obtained via a given URL
  • the service 160 may generate a pipeline combining the first and second data manipulations.
  • the service 160 may illustratively implement a hierarchy of criteria, such that manipulations applied to objects are placed within the pipeline prior to manipulations applied to a URI, etc.
  • client devices 102 may be enabled to request inclusion of a data manipulation within a pipeline.
  • a client device 102 may specify a particular data manipulation to be included within a pipeline applied in connection with the request.
  • a collection owner may specify one or more data manipulations allowed for the collection, and further specify identifiers for those manipulations (e.g., function names).
  • identifiers for those manipulations (e.g., function names).
  • client-requested manipulations are appended to the end of a pipeline subsequent to owner-specified data manipulations and prior to implementing the requested request method.
  • the search function can receive as input data the output of an owner-specified data manipulations for the data set (e.g., manipulations to remove confidential information from the data set).
  • requests may in some embodiments specify parameters to be passed to one or more data manipulations (whether specified within the request or not). Accordingly, while embodiments of the present disclosure can enable data manipulations without knowledge of those manipulations on the part of client devices 102, other embodiments may enable client devices 102 to pass information within an I/O request for use in implementing data manipulations.
  • a serverless task execution may be passed the content of a request (including, e.g., a called method and parameters) and be configured to modify and return, as a return value to a frontend 162, a modified version of the method or parameters.
  • a serverless task execution may be passed a call to “GET” that data object, and may transform parameters of the GET request such that it applies only to a specific byte range of the data object corresponding to the portion that the user may access.
  • tasks may be utilized to implement customized parsing or restrictions on called methods, such as by limiting the methods a user may call, the parameters to those methods, or the like.
  • application of one or more functions to a request may be viewed as a “pre-data processing” pipeline, and may thus be implemented prior to obtaining the input data within the pipeline 400 (winch input data may change due to changes in the request), or may be implemented independently of a data manipulation pipeline 400.
  • a data object may contain sensitive data that a data owner desires to remove prior to providing the data to a client.
  • the owner may further enable a client to specify native manipulations to the data set, such as conducting a database query on the dataset (e.g., via a SELECT resource method).
  • embodiments of the present disclosure can enable an owner to specify manipulations to occur subsequent to application of a called method but prior to conducting a final operation to satisfy a request.
  • the service 160 may first conduct the SELECT operation against specified input data (e.g., a data object), and then pass the output of that SELECT operation to a data manipulation, such as a serverless task execution. The output of that execution can then be returned to a client device 102 to satisfy the request.
  • specified input data e.g., a data object
  • a data manipulation such as a serverless task execution.
  • the output of that execution can then be returned to a client device 102 to satisfy the request.
  • FIG. 3 and FIG. 4 are generally described with reference to serverless tasks authored by an owner of an object or collection
  • the sendee 160 may enable code authors to share their tasks with other users of the sendee 160, such that code of a first user is executed in the I/O path of an object owned by a second user.
  • the service 160 may also provide a library of tasks for use by each user.
  • the code of a shared task may be provided to other users.
  • the code of the shared task may be hidden from other users, such that the other users can execute the task but not view code of the task.
  • other users may illustratively be enabled to modify specific aspects of code execution, such as the permissions under which the code will execute.
  • FIGS. 5A and 5B illustrative interactions will be discussed for applying a modification to an I/O path for a request to store an object on the service 160, which request is referred to in connection with these figures as a “PUT” request or “PUT object call.” While shown in two figures, numbering of interactions is maintained across FIGS. 5A and 5B.
  • the interactions begin at (1), where a client device 102A submits a PUT object call to the storage service 160, corresponding to a request to store input data (e.g., included or specified within the call) on the sendee 160.
  • the input data may correspond, for example, to a file stored on the client device 102A.
  • the call is directed to a frontend 162 of the service 162 that, at (2), retrieves from the I/O path modification data store 164 an indication of modifications to the I/O path for the call.
  • the indication may reflect, for example, a pipeline to be applied to calls received on the I/O path.
  • the I/O path for a call may generally be specified with respect to a request method included within a call, an object or collection of objects indicated within the call, a specific mechanism of reaching the sendee 160 (e.g., protocol, URI used, etc.), an identity or authentication status of the client device 102 A, or a combination thereof. For example, in FIG.
  • the I/O path used can correspond to use of a PUT request method directed to a particular URI (e.g., associated with the frontend 162) to store an object in a particular logical location on the sendee 160 (e.g., a specific bucket).
  • a PUT request method directed to a particular URI e.g., associated with the frontend 162
  • a particular logical location on the sendee 160 e.g., a specific bucket.
  • FIGS. 5 A and 5B it is assumed that an owner of that logical location has previously specified a modification to the I/O path, and specifically, has specified that a serverless function should be applied to the input data before a result of that function is stored in the sendee 160.
  • the frontend 162 detects within the modifications for the I/O path inclusion of a serverless task execution.
  • the frontend 162 submits a call to the on-demand code execution system 120 to execute the task specified within the modifications against the input data specified within the call.
  • the on-demand code execution system 120 at (5), therefore generates an execution environment 502 in which to execute code corresponding to the task.
  • the call may be directed to a frontend 130 of the system, which may distribute instructions to a worker manager 140 to select or generate a VM instance 150 in which to execute the task, which VM instance 150 illustratively represents the execution environment 502.
  • the system 120 further provisions the environment with code 504 of the task indicated within the I/O path modification (which may be retrieved, for example, from the object data stores 166). While not shown in FIG. 5 A, the environment 502 further includes other dependencies of the code, such as access to an operating system, a runtime required to execute the code, etc.
  • generation of the execution environment 502 can include configuring the environment 502 with security constraints limiting access to network resources.
  • the environment 502 can be configured with no ability to send or receive information via a network.
  • access to such resources can be provided on a “whitelist” basis, such that network communications from the environment 502 are allowed only for specified domains, network addresses, or the like.
  • Network restrictions may be implemented, for example, by a host device hosting the environment 502 (e.g., by a hypervisor or host operating system). In some instances, network access requirements may be utilized to assist in placement of the environment 502, either logically or physically.
  • the environment 502 for the task may be placed on a host device that is distant from other network-accessible services of the service provider system 110, such as an “edge” device with a lower-quality communication channel to those services.
  • a task requires access to otherwise private network services, such as services implemented within a virtual private cloud (e.g., a local-area-network-like environment implemented on the service 160 on behalf of a given user)
  • the environment 502 may be created to exist logically within that cloud, such that a task execution 502 accesses resources within the cloud.
  • a task may be configured to execute within a private cloud of a client device 102 that submits an I/O request.
  • a task may be configured to execute within a private cloud of an owner of the object or collection referenced within the request.
  • the system 120 provisions the environment with stream-level access to an input file handle 506 and an output file handle 508, usable to read from and write to the input data and output data of the task execution, respectively.
  • files handle 506 and 508 may point to a (physical or virtual) block storage device (e.g., disk drive) attached to the environment 502, such that the task can interact with a local file system to read input data and write output data.
  • the environment 502 may represent a virtual machine with a virtual disk drive, and the system 120 may obtain the input data from the sendee 160 and store the input data on the virtual disk drive.
  • the system 120 may pass to the code a handle of the input data as stored on the virtual disk drive, and a handle of a file on the drive to which to write output data.
  • files handle 506 and 508 may point to a network file system, such as an NFS-compatible file system, on winch the input data has been stored.
  • the frontend 162 during processing of the call may store the input data as an object on the object data stores 166, and the file-level interface 166 may provide file-level access to the input data and to a file representing output data.
  • the file handies 506 and 508 may point to files on a virtual file system, such as a file system in user space.
  • handles 506 and 508 the task code 504 is enabled to read the input data and write output data using stream manipulations, as opposed to being required to implement network transmissions. Creation of the handles 506 and 508 (or streams corresponding to the handies) may illustratively be achieved by execution of staging code 157 within or associated with the environment 502.
  • FIG. 5B The interactions of FIG. 5 A are continued in FIG. 5B, where the system 120 executes the task code 504.
  • the task code 504 may be user-authored, any number of functionalities may be implemented within the code 504.
  • the code 504 when executed, reads input data from the input file handle 506 (which may be passed as a commonly used input stream, such as stdin), manipulates the input data, and writes output data to the output file handle 508 (which may be passed as a commonly used output stream, such as stdout).
  • the system 120 obtains data written to the output file (e.g., the file referenced in the output file handle) as output data of the execution.
  • the system 120 obtains a return value of the code execution (e.g., a value passed in a final call of the function). For the purposes of description of FIGS. 5A and 5B, it will be assumed that the return value indicates success of the execution.
  • the output data and the success return value are then passed to the frontend 162.
  • output data of a task execution and a return value of that execution may be returned separately.
  • task code 504 may write to an output file through the handle 508, and this data may be periodically or iteratively returned to the service 160.
  • the staging code may detect and forward each write to the output file to the frontend 162.
  • writes to the file may directly cause the written data to be transmitted to the interface 166 and thus the sendee 160.
  • transmitting written data iteratively may reduce the amount of storage required locally to the environment 502, since written data can, according to some embodiments, be deleted from local storage of the environmen t 502.
  • an error return value may be used to indicate to the frontend 162 that an error occurred during execution of task code 504.
  • user-defined return values may be used to control how conditional branching within a pipeline proceeds.
  • the return value may indicate to the frontend 162 a request for further processing.
  • a task execution may return to the frontend 162 a call to execute another serverless task (potentially not specified within a path modification for the current I/O path).
  • return values may specify to the frontend 162 what return value is to be returned to the client device 102A.
  • a typical PUT request method called at the service 160 may be expected to return an HTTP 200 code (“OK”).
  • a success return value from the task code may further indicate that the frontend 162 should return an HTTP 200 code to the client device 102A.
  • An error return value may, for example, indicate that the frontend 162 should return a 3XX HTTP redirection or 4XX HTTP error code to the client device 102 A.
  • return values may specify to the frontend 162 content of a return message to the client device 102 A other than a return value.
  • the frontend 162 may be configured to return a given HTTP code (e.g , 200) for any request from the client device 102A that is successfully retrieved at the frontend 162 and invokes a data processing pipeline.
  • a task execution may then be configured to specify, within its return value, data to be passed to the client device 102A in addition to that HTTP code.
  • data may illustratively include structured data (e.g., extensible markup language (XML) data) providing information generated by the task execution, such as data indicating success or failure of the task.
  • XML extensible markup language
  • the success return value of the task indicates that an HTTP 2XX success response should be passed to the device 102A.
  • the frontend 162 stores the output data as an object within the object data stores 166, (11).
  • Interaction (11) illustratively corresponds to implementation of the PUT request method, initially called for by the client device 102A, albeit by storing the output of the task execution rather than the provided input data.
  • the frontend 162 After implementing the called PUT request method, the frontend 162, at (12), returns to the client device 102A the success indicator indicated by the success return value of the task (e.g., an HTTP 200 response code).
  • a call to PUT an object on the storage sendee 160 resulted in creation of that object on the sendee 160.
  • the object stored on the sendee 160 corresponds to output data of an owner-specified task, thus enabling the owner of the object greater control over the contents of that object.
  • the service 160 may additionally store the input data as an object (e.g., where the owner-specified task corresponds to code executable to provide output data usable in conjunction with the input data, such as checksum generated from the input data).
  • FIGS. 6A and 6B illustrative interactions will be discussed for applying a modification to an I/O path for a request to retrieve an object on the service 160, which request is referred to in connection with these figures as a “GET” request or “GET call.” While shown in two figures, numbering of interactions is maintained across FIGS. 6A and 6B.
  • the interactions begin at (1), where a client device 102A submits a GET call to the storage send ce 160, corresponding to a request to obtain data of an obj ect (identified within the call) stored on the service 160
  • the call is directed to a frontend 162 of the sendee 160 that, at (2), retrieves from the I/O path modification data store 164 an indication of modifications to the I/O path for the call.
  • the I/O path used can correspond to use of a GET request method directed to a particular URI (e.g., associated with the frontend 162) to retrieve an object in a particular logical location on the service 160 (e.g., a specific bucket).
  • the frontend 162 detects within the modifications for the I/O path inclusion of a serverless task execution.
  • the frontend 162 submits a call to the on-demand code execution system 120 to execute the task specified within the modifications agamst the object specified within the call.
  • the on-demand code execution system 120 at (5), therefore generates an execution environment 502 in which to execute code corresponding to the task.
  • the call may be directed to a frontend 130 of the system, which may distribute instructions to a worker manager 140 to select or generate a VM instance 150 in which to execute the task, which VM instance 150 illustratively represents the execution environment 502.
  • the system 120 further provisions the environment with code 504 of the task indicated within the I/O path modification (which may be retrieved, for example, from the object data stores 166). While not shown in FIG. 6A, the environment 502 further includes other dependencies of the code, such as access to an operating system, a runtime required to execute the code, etc.
  • the system 120 provisions the environment with file-level access to an input file handle 506 and an output file handle 508, usable to read from and write to the input data (the object) and output data of the task execution, respectively.
  • files handle 506 and 508 may point to a (physical or virtual) block storage device (e.g , disk drive) attached to the environment 502, such that the task can interact with a local file system to read input data and write output data.
  • the environment 502 may represent a virtual machine with a virtual disk drive, and the system 120 may obtain the object referenced within the call from the service 160, at (6% and store the object on the virtual disk drive.
  • the system 120 may pass to the code a handle of the object as stored on the virtual disk drive, and a handle of a file on the drive to which to write output data.
  • files handle 506 and 508 may point to a network file system, such as an NFS-compatible file system, on which the object has been stored.
  • the file-level interface 166 may provide file-level access to the object as stored within the object data stores, as well as to a file representing output data.
  • the task code 504 is enabled to read the input data and write output data using stream manipulations, as opposed to being required to implement network transmissions. Creation of the handles 506 and 508 may illustrati vely be achieved by execution of staging code 157 within or associated with the environment 502.
  • FIG. 6A The interactions of FIG. 6A are continued in FIG 6B, where the system 120 executes the task code 504 at (7).
  • the task code 504 may be user-authored, any number of functionalities may be implemented within the code 504.
  • the code 504 when executed, reads input data (corresponding to the object identified within the call) from the input file handle 506 (which may be passed as a commonly used input stream, such as stdin), manipulates the input data, and writes output data to the output file handle 508 (which may be passed as a commonly used output stream, such as stdout).
  • the system 120 obtains data written to the output file (e.g., the file referenced m the output file handle) as output data of the execution.
  • the system 120 obtains a return value of the code execution (e.g., a value passed in a final call of the function). For the purposes of description of FIGS. 6A and 6B, it wall be assumed that the return value indicates success of the execution.
  • the output data and the success return value are then passed to the frontend 162.
  • the frontend 162 On receiving output data and the return value, the frontend 162 returns the output data of the task execution as the requested object.
  • Interaction (11) thus illustratively corresponds to implementation of the GET request method, initially called for by the client device 102A, albeit by returning the output of the task execution rather than the object specified within the call.
  • a call to GET an object from the storage service 160 therefore results in return of data to the client device 102 A as the object.
  • the data provided to the client device 102 A corresponds to output data of an owner-specified task, thus enabling the owner of the object greater control over the data returned to the client device 102 A.
  • output data of a task execution and a return value of that execution may be returned separately.
  • success return value is assumed in FIGS. 6A and 6B, other types of return valise are possible and contemplated, such as error values, pipeline-control values, or calls to execute other data manipulations.
  • return values may indicate what return value is to be returned to the client device 102A (e.g., as an HTTP status code). In some instances, where output data is iteratively returned from a task execution, the output data may also be iteratively provided by the frontend 162 to the client device 102 A.
  • output data is large (e.g., on the order of hundreds of megabytes, gigabytes, etc.)
  • iteratively returning output data to the client device 102A can enable that data to be provided as a stream, thus speeding delivery of the content to the device 102A relative to delaying return of the data until execution of the task completes.
  • a serverless task may be inserted into the I/O path of the service 160 to perform functions other than data manipulation.
  • a serverless task may be utilized to perform validation or authorization with respect to a called request method, to verify that a client device 102A is authorized to perform the method.
  • Task-based validation or authorization may enable functions not provided natively by the service 160.
  • embodiments of the present disclosure enable the owner to insert into an I/O path to the collection (e.g., a GET path using a given URI to the collection) a serverless task that determines whether the client is authorized to retrieve a requested object based on a creation time of that object.
  • the return value provided by an execution of the task may correspond to an “authorized” or “unauthorized” response.
  • a task does not perform data manipulation, it may ⁇ be unnecessary to provision an environment of the task execution with input and output stream handles.
  • the service 160 and system 120 can be configured to forego provisioning the environment with such handies in these cases.
  • Whether a task implements data manipulation may be specified, for example, on creation of the task and stored as metadata for the task (e.g., within the object data stores 166). The service 160 may thus determine from that metadata whether data manipulation within the task should be supported by provisioning of appropriate stream handies.
  • the system 120 may be configured to detect completion of a function based on interaction with an output stream handle.
  • staging code within an environment e.g., providing a file system in user space or network-based file system
  • the staging code may interpret such a call as successful completion of the function, and notify the sendee 160 of successful completion without requiring the task execution to explicitly provide return value.
  • Such information may include the content of the request from the client device 102 (e.g., the HTTP data transmitted), metadata regarding the request (e.g., a network address from which the request was received or a time of the request), metadata regarding the client device 102 (e.g., an authentication status of the device, account time, or request history), or metadata regarding the requested object or collection (e.g., size, storage location, permissions, or time created, modified, or accessed).
  • the request e.g., the HTTP data transmitted
  • metadata regarding the request e.g., a network address from which the request was received or a time of the request
  • metadata regarding the client device 102 e.g., an authentication status of the device, account time, or request history
  • metadata regarding the requested object or collection e.g., size, storage location, permissions, or time created, modified, or accessed.
  • task executions may be configured to modify metadata regarding input data, which may be stored together with the input data (e.g., within the object) and thus written by way of an output stream handle, or which may be separately stored and thus modified by way of a metadata stream handle, inclusion of metadata in a return value, or separate network transmission to the service 160.
  • routine 700 for implementing owner- defined functions in connection with an I/O request obtained at the object storage sendee of FIG. 1 over an I/O path will be described.
  • the routine 700 may illustratively be implemented subsequent to association of an I/O path (e.g., defined in terms of an object or collection, a mechanism of access to the object or collection, such as a URI, an account transmitting an IO request, etc.) with a pipeline of data manipulations.
  • the routine 700 may be implemented prior to the interactions of FIG. 3, discussed above.
  • the routine 700 is illustratively implemented by a frontend 162.
  • the routine 700 begins at block 702, where the frontend 162 obtains a request to apply an I/O method to input data.
  • the request illustratively corresponds to a client device (e.g., an end user device).
  • the I/O method may correspond, for example, to an HTTP request method, such as GET, PUT, LIST, DELETE, etc.
  • the input data may be included within the request (e.g., within a PUT request), or referenced in the request (e.g., as an existing object on the object storage service 160.
  • the frontend 162 determines one or more data manipulations in the I/O path for the request.
  • the I/O path may be defined based on a variety of criteria (or combinations thereof), such as the object or collection referenced in the request, a URI through which the request was transmitted, an account associated with the request, etc.
  • Manipulations for each defined I/O path may illustratively be stored at the object storage sendee 160.
  • the frontend 162 may compare parameters of the I/O path for the request to stored data manipulations at the object storage sendee 160to determine data manipulations inserted into the I/O path.
  • the manipulations form a pipeline, such as the pipeline 400 of FIG.
  • an additional data manipulation may be specified within the request, which data manipulation may be inserted, for example, prior to pre-specified data manipulations (e.g., not specified within the request). In other instances, the request may exclude reference to any data manipulation.
  • the frontend 162 passes input data of the I/O request to an initial data manipulation for the I/O path.
  • the initial data manipulation may include, for example, a native manipulation of the object storage service 160 or a serverless task defined by an owner of the object or collection referenced in the call.
  • the frontend 162 may pass the input to the object manipulation engine 170 of FIG. 1.
  • the frontend 162 can pass the input to the on-demand code execution system 120 of FIG. 1 for processing via an execution of the task.
  • An illustrative routine for implementing a serverless task is described below with reference to FIG. 8.
  • FIG. 7 illustratively describes data manipulations
  • other processing may be applied to an I/O path by an owner.
  • an owner may insert into an I/O path for an object or collection a serverless task that provides authentication independent of data manipulation.
  • block 706 may be modified such that other data, such as metadata regarding a request or an object specified in the request, is passed to an authentication function or other path manipulation.
  • the routine 700 proceeds to block 708, where the implementation of the routine 700 varies according to whether additional data manipulations have been associated with the I/O path. If so, the routine 700 proceeds to block 710, where an output of a prior manipulation is passed to a next manipulation associated with the I/O path (e.g., a subsequent stage of a pipeline).
  • routine 700 then returns to block 708, until no additional manipulations exist to be implemented.
  • the routine 700 then proceeds to block 712, where the frontend 162 applies the called I/O method (e.g., GET, PUT, POST, LIST, DELETE, etc.) to the output of the prior manipulation.
  • the frontend 162 may provide the output as a result of a GET or LIST request, or may store the output as a new object as a result of a PUT or POST request.
  • the frontend 162 may further provide a response to the request to a requesting device, such as an indication of success of the routine 700 (or, in cases of failure, failure of the routine).
  • the response may be determined by a return value provided by a data manipulation implemented at blocks 706 or 710 (e.g., the final manipulation implemented before error or success).
  • a manipulation that indicates an error e.g., lack of authorization
  • a manipulation that proceeds successfully may instruct the frontend 162 to return an HTTP code indicating success, or may instruct the frontend 162 to return a code otherwise associated with application of the I/O method (e.g., in the absence of data manipulations).
  • the routine 700 thereafter ends at block 714.
  • routine 700 enables an owner of data objects to assert greater control over I/O to an object or collection stored on the object storage service 160 on behalf of the owner.
  • serverless task executions may provide a return value.
  • this return value may instruct a frontend 162 as to further actions to take in implementing the manipulation.
  • an error return value may instruct the frontend 162 to halt implementation of manipulations, and provide a specified error value (e.g., an HTTP error code) to a requesting device.
  • Another return value may instruct the frontend 162 to implement an additional serverless task or manipulation.
  • routine 700 may in some cases be modified to include, subsequent to blocks 706 and 710 for example, handling of the return value of a prior manipulation (or block 708 may be modified to include handling of such a value).
  • routine 700 is intended to be illustrative in nature.
  • an illustrative routine 800 will be described for executing a task on the on-demand code execution system of FIG. 1 to enable data manipulations during implementation of an owner-defined function.
  • the routine 800 is illustratively implemented by the on-demand code execution system 120 of FIG. 1.
  • the routine 800 begins at block 802, where the system 120 obtains a call to implement a stream manipulation task (e.g., a task that manipulations data provided as an input IO stream handle).
  • the call may be obtained, for example, in conjunction with blocks 706 or 710 of the routine 700 of FIG. 7.
  • the call may include input data for the task, as well as other metadata, such as metadata of a request that preceded the call, metadata of an object referenced within the call, or the like.
  • the system 120 generates an execution environment for the task.
  • Generation of an environment may include, for example, generation of a container or virtual machine instance in which the task may execute and provisioning of the environment with code of the task, as well as any dependencies of the code (e.g., runtimes, libraries, etc.).
  • the environment is generated with network permissions corresponding to permissions specified for the task. As discussed above, such permissions may be restnctively (as opposed to permissively) set, according to a wlutelist for example. As such, absent specification of permissions by an owner of an I/O path, the environment may lack network access. Because the task operates to manipulate streams, rather than network data, this restrictive model can increase security without detrimental effect on functionality.
  • the environment may be generated at a logical network location providing access to otherwise restricted network resources. For example, the environment may be generated within a virtual private local area network (e.g., a virtual private cloud environment) associated with a calling device.
  • the system 120 stages the environment with an 10 stream representing to input data.
  • the system 120 may configure the environment with a file system that includes the input data, and pass to the task code a handle enabling access of the input data as a file stream.
  • the system 120 may configure the environment with a network file system, providing network-based access to the input data (e.g., as stored on the object storage system).
  • the system 120 may configure the environment with a “local” file system (e.g., from the point of view of an operating system providing the file system), and copy the input data to the local file system.
  • the local file system may, for example, be a filesystem in user space (FUSE).
  • the local file system may be implemented on a virtualized disk drive, provided by the host device of the environment or by a network-based device (e.g., as a network-accessible block storage device).
  • the system 120 may provide the IO stream by “piping” the input data to the execution environment, by waiting the input data to a network socket of the environment (which may not provide access to an external network), etc.
  • the system 120 further configures the environment with stream-level access to an output stream, such as by creating a file on the file system for the output data, enabling an execution of the task to create such a file, piping a handle of the environment (e.g., stdout) to a location on another VM instance colocated with the environment or a hypervisor of the environment, etc.
  • a handle of the environment e.g., stdout
  • the task is executed within the environment.
  • Execution of the task may include executing code of the task, and passing to the execution handles or handles of the input stream and output stream.
  • the system 120 may pass to the execution a handle for the input data, as stored on the file system, as a “stdin” variable.
  • the system may- further pass to the execution a handle for the output data stream, e.g., as a “stdout” variable.
  • the system 120 may pass other information, such as metadata of the request or an object or collection specified within the request, as parameters to the execution.
  • the code of the task may thus execute to conduct stream manipulations on the input data according to functions of the code, and to write an output of the execution to the output stream using OS- level stream operations.
  • the routine 800 then proceeds to block 810, where the system 120 returns data written to the output stream as output data of the task (e.g., to the frontend 162 of the object storage system).
  • block 810 may occur subsequent to the execution of the task completing, and as such, the system 120 may return the data written as the complete output data of the task.
  • block 810 may occur during execution of the task. For example, the system 120 may detect new data written to the output stream and return that data immediately, without awaiting execution of the task.
  • the system 120 may delete data of the output file after writing, such that sending of new r data immediately obviates a need for the file system to maintain sufficient storage to store ail output data of the task execution. Still further, in some embodiments, block 810 may occur on detecting a close of the output stream handle describing the output stream.
  • the system 120 returns a return value provided by the execution (e.g., to the frontend 162 of the object storage system).
  • the return value may specify an outcome of the execution, such as success or failure.
  • the return value may specify a next action to be undertaken, such as implementation an additional data manipulation.
  • the return value may specify data to be provided to a calling device requesting an I/O operation on a data object, such as an HTTP code to be returned.
  • the frontend 162 may obtain such return value and undertake appropriate action, such as returning an error or HTTP code to a calling device, implementing an additional data manipulation, performing an I/O operation on output data, etc.
  • a return value may be explicitly specified within code of the task. In other instances, such as where no return value is specified within the code, a default return value may be returned (e.g., a ‘ G indicating success).
  • the routine 800 then ends at block 814.
  • embodiments enable insertion of a processing function into the input/output path of each portion, such that individual intermediate or initial (or first) functions can be executed on each portion.
  • embodiments also enable insertion of a processing function that combines the individual intermediate or initial function outputs (e.g., the checksum values of each portion of the input file, etc.) to determine a final (or second) function output associated with the reassembled input file (e.g., such as determining a checksum value of the reassembled file, or determining some other function output based on the reassembled file).
  • a processing function that combines the individual intermediate or initial function outputs (e.g., the checksum values of each portion of the input file, etc.) to determine a final (or second) function output associated with the reassembled input file (e.g., such as determining a checksum value of the reassembled file, or determining some other function output based on the reassembled file).
  • Pre-calculation of an intermediate function output (such as a checksum), either in parallel or iteratively during upload of portions, enables the function output (e.g., the checksum) for a complete file to be calculated much more rapidly after uploading is complete, as compared to calculating the function output of the complete, reassembled file only after the uploading and reassembling of the input file is complete.
  • the term “reassembled” may also be referred to as “unified.”
  • a reassembled file, object, or data may also be referred to as a unified file, object, or data.
  • Multi-part upload enables a client to split a file into separate portions and the upload the separate portions in parallel. Once all portions have been successfully uploaded, the client may submit a call to merge, or reassemble the separate portions to form the original file. The client may also submit a manifest with the call that indicates which portions are to be merged, and the order in which the portions are to be merged.
  • a checksum value is an error- detecting code determined from a set of data and used to detect changes to the set of data.
  • One such checksum value is determined using a cyclical redundancy check (e.g., CRC-32, which is a 32-bit cyclical redundancy check).
  • CRC-32 which is a 32-bit cyclical redundancy check.
  • a checksum algorithm enables calculation of a value, or a checksum, for an object, where the value is smaller than the object, but is would significantly change if even minor changes to the object occur. Therefore, checksums can be used to detect errors associated with the transfer of the object from one location to another.
  • the routine illustrated m FIG. 9 may he used to compute the checksum for other value) of an input file from individual checksums (or other values) determined from individual portions of the input file.
  • FIG. 9 is a flow diagram of an illustrative routine 900 that may be executed by an object storage service, such as object storage service 160, a code execution service (or a function running within the code execution service), such as the on-demand code execution system 120, or both.
  • the routine 900 may be used to dynamically process input data portions (sometimes referred to as chunks, parts, or data sub-objects) of input data at run time (“on-the- fly”). Such processing may occur as the input data portions are uploaded to and stored as data object portions in an object storage service (such as, for example, object storage service 160) and in nesponse to a request to merge the data object portions into a data object stored on the object storage service.
  • routine 900 is described with respect to calculating a checksum value of an input file based upon individual checksum values of certain independently-uploaded input file portions, the routine may be used to determine a function output based upon any initial, or intermediate function outputs.
  • the routine 900 may be used to automatically determine a checksum value of (or perform a first function on) each individual input data portion as it is uploaded and prior to reassembling the individual data object portions into the data object representing the complete input data. Determining a checksum value of each individual input data portion as it is uploaded and prior to reassembling the input data can advantageously reduce the amount of time before the stored input data is ready for further processing or retrieval. For example, if errors occur during input data portion upload, the error may be detected as soon as the input data portion upload is completed, instead of after the complete input data is reassembled. Such error detection can result in the re-uploading of just the input data portion having such errors.
  • first values determined from each input data portion as they uploaded may be used to detect a first condition, instead of determining the first condition after the complete input data is reassembled. Additional processing may be performed with respect to each input data portion based on its corresponding first value, as well.
  • a checksum value of the complete input data may be determined from the checksum values of each of the individual input data portion checksum values instead of from the reassembled input data (e.g., after reassembling the portions into the data object).
  • a second or final value associated with the complete input data may be determined from the first values of the individual data portions instead of from the reassembled input data by applying a second function to the first values.
  • Determining the checksum (or second value) of the input data from the checksums (or first values) of its input data portions advantageously reduces latency and computing resource requirements. Aspects of the routine 900 will be described with additional reference to FIG. 10, which is a system diagram of illustrative data flows and interactions between various components of the service provider system 110.
  • the routine 900 may begin in response to an event, such as submission of a request from a client device 102 to upload input data to the object storage sendee 160.
  • an owner of a collection of data objects to which the input data is to be added as a new data object may have previously specified that, on uploading of an object to the collection using multi-part upload, a first task should be executed to process each portion of the data object uploaded, and that a second task should be executed on a request to reassemble the portions into the data object.
  • the routine 900 or portions thereof may be implemented on multiple processors, serially or in parallel.
  • the object storage sendee 160 can receive a request to store input data submitted via multi-part upload.
  • FIG. 10 illustrates the object storage service 160 receiving the request at (1).
  • the request illustratively includes parameters, such as an identifier of the input data to be stored by the object storage service 160 as a data object, a location to store the data object; context data regarding the request; other data; or some combination thereof.
  • the request may be a resource request, such as a PUT request, for particular input data to be stored in the object data store 166 of the object storage service 160, which input data is to be provided via multi-part upload.
  • the object storage service 160 can also determine that function output is to be generated using portions of the input data to be stored m the object storage service 160. In some embodiments, the determination may be based on context data and/or the input data itself. For example, the object storage service 160 may receive an indication that the client will transfer the input data to the storage service 160 using a multi-part file transfer protocol, or the input data may be required to be uploaded to the object storage service 160 using a multi-part file transfer protocol. In such case, the object storage service 160 will determine an object identifier (e.g., an object ID) for the multi-part input data to be transferred. The object storage service 160 will provide the object ID to the client.
  • an object identifier e.g., an object ID
  • the input data is not transferred using a multi-part file transfer protocol. Instead, the input data is transferred in portions (e.g., objects, sub-objects, files, delineated elements, etc.), but not necessarily according to a multi-part file transfer protocol.
  • a manifest or list may be provided to identify the portions that are to be subsequently joined together, and the order in which they are to be joined together, to reassemble the complete input data from its portions.
  • the object storage service 160 may receive a portion of the input data from the client.
  • the input data may be a file, a composite file (e.g., a compressed file, such as a filed compressed according to a .zip, .tar or other compressed file format), a composable object, or a super-composable object composed of individual objects or sub-objects.
  • Each input data portion is received with associated metadata, which can include the object ID and an indication of one or more functions to be performed on the input data portion, the complete input data, or both.
  • the metadata can include a checksum value associated with the data object portion (the “received CV”).
  • the received input data portion, object ID, and metadata may be stored by the object storage service 160 m one or more staging areas. Staging areas are data storage locations, and include data storage accessible via a block storage sendee, a local disk, the object data store 166 of the object storage service 160, or other data storage location.
  • the received input data portion, object ID, and metadata may be stored in the same or different staging areas.
  • multiple input data portions may be received by the object storage system 160 in parallel, during at least partially overlapping time periods.
  • the input data portions may be received in a different order than the order in which the input data portions are to be assembled into the complete data object.
  • the metadata can include an input data portion identifier (input data portion ID) that can be used to designate the input data portions to be used, and the order in which the input data portions are to be arranged, to assemble the complete input data.
  • input data portion ID an input data portion identifier
  • the input data portions may be the same size or have different sizes than one another.
  • the indications of one or more functions to be performed on the input data portion, the complete input data, or both can include an indication to manipulate and/or validate the input data portion, the input data, or both, prior to storing the input data within the object storage service 160 object data store 166.
  • the indication can indicate that the input data portion, the complete input data, or both, are to be compressed, decompressed, encrypted, decrypted, or a combination thereof, prior to being stored within the object storage service 160 object data store 166.
  • the indication can indicate that the input data portion, the complete input data, or both, are to be error checked prior to subsequent manipulation.
  • the input data portions may be individually error checked, or checksum checked prior to being reassembled to the complete input data.
  • the reassembled input data may be checksum checked prior to being stored m the object data store storage 166.
  • the object storage service 160 may automatically error check each input data portion and/or the complete input data without receiving an indication instructing the object storage service 160 to do so.
  • the object storage sendee 160 may initiate error detection of each input data portion as soon as it is completely received, without waiting to reassemble the complete input data.
  • FIG. 10 illustrates the object storage sendee 160 receiving and storing portion! s) of the input data at (2).
  • the object storage sendee 160 can make a call to the execution environment 502 to execute a function (e.g., a first function) to determine a checksum value of (or perform a different calculation or determination using) the input data portion.
  • FIG. 10 illustrates the object storage sendee 160 making a call to the execution environment 502, and the execution environment 502 (or the function running within the execution environment 502) returning a result at (3).
  • the VM instance 150 or other execution environment 502 can execute the function by using the input data portion.
  • the VM instance 150 or other execution environment 502 may determine a checksum value (a “determined CV”) associated with the input data portion.
  • the execution environment 502 may perform any of a variety of error detection operations on the input data portion, including a cyclical redundancy check (e.g., CRC-32) or any other para!lelizab!e error detection operation.
  • a parallelizable error detection operation is an error detection operation that may be performed on portions of input data, and the individual outputs of the error detection operation may be combined or otherwise used to determine a checksum or other data integrity indication associated with the complete input data.
  • Each determined CV may be stored in any of a variety of ways, including storing it as metadata with the input data portion, with a relational or non-relational database service, using a relational or non-relational database management system, or storing it with the object storage service.
  • the object storage service 160 can process the output of the function received from the execution environment 502 (or the function running within the execution environment 502). For example, the object storage sendee can perform error detection for (or perform some other calculation or determination using) the input data portion using the output data, such as the determined CV, received from the execution environment 502 (or the function running within the execution environment 502). Error detection may include comparing the determined CV to the stored, received CV. If the two values are different, the object storage service 160 may determine that an error has occurred during upload of the input data portion, and the client may be requested to re-send the associated input data portion.
  • FIG. 10 illustrates the object storage sendee 160 processing the output(s) of the function(s) at (4).
  • the object storage service 160 may provide the determined CV (or first values) associated with the input data portion to the client.
  • the client may receive the determined CV and compare it to a client-determined checksum value of the input data portion (or otherwise process the first values). If the two values are different, the client may determine that it needs to re-send the associated input data portion to the object storage service 160. In such case, the client will instruct the object storage service 160 that the input data portion is being re-uploaded.
  • the execution environment 502 (or the function running within the execution environment 502) is configured to perform the function on a fixed-sized portion of the input data (or input data portion).
  • the size of the fixed-sized portion may be configured by the client. For example, the size may be designated using a parameter send to the object storage service 160 in connection with the initiation of the input data multi-part upload process. In some embodiments, the size is predetermined by the object storage service 160 or execution environment 502 (or the function running within the execution environment 502).
  • the client may wish to upload a 10 GB file as input data using a multi-part upload process.
  • the client may upload the input data in multiple portions, each having the same or different size.
  • the client may upload the input data in ten 1 GB data object portions.
  • the execution environment 502 may process each portion as it is received (as discussed above), or it may process a fixed-sized portion of each portion, instead.
  • the execution environment 502 may process each 100 MB (or other predetermined, fixed size) of each 1 GB data object as it is received.
  • Such fixed-sized portion processing can advantageously enable the execution environment 502 to operate on a known fixed sized input. Such configuration would greatly simplify and improve the efficiency of the provisioning the staging area storage used to process each fixed-sized portion of the input data portion.
  • fixed-sized portion processing is used automatically if the complete input data size, or if an input data portion size exceeds a threshold value.
  • Blocks 904 to 908 define a parallelizable block 909 that may be iterated multiple times in parallel or sequentially, or both.
  • the blocks of block 909 may be performed for each input data portion received from the client, and in parallel (e.g., during at least partially overlapping time periods).
  • the object storage sendee 160 (or VM instance 150, other execution environment 502, or the function running within the execution environment 502) can receive a request to perform a second function based on at least a portion of the first outputs.
  • the object storage service 160 can receive a request to determine a checksum of the reassembled input data from the stored input data portions, submitted via multi-part upload, or a request to reassemble the input data from the stored input data portions.
  • the request illustratively includes parameters, such as an identifier of the input data portions to be reassembled and stored by the object storage service 160 as a data object, a location to store the data object; context data regarding the request; other data; or some combination thereof.
  • the request may be a resource request, such as a PUT request.
  • the object storage service 160 can also determine that function output is to be generated using portions of the input data stored in the object storage service 160. In some embodiments, the determination may be based on context data and/or the input data itself. For example, the object storage service 160 may receive an indication that previously received input data portions are to be combined together. A manifest or list may be provided to identify the portions that are to be joined together, and the order in which they are to be joined together, to reassemble the complete input data from previously uploaded portions.
  • the object storage service 160 may execute a call to the execution environment 502 (or the function running within the execution environment 502) to determine a checksum of the reassembled input data by (or perform a second function) using the individual checksums (or first values) of each of the input data portion checksums.
  • FIG. 10 illustrates object storage service 160 executing the call to the execution environment 502 (or the function running within the execution environment 502) to determine a checksum of the reassembled input data at (6).
  • the object storage service 160 receives a manifest from the client that identifies the input data portions that are to be reassembled into the complete input data.
  • the manifest also identifies the order in which the input data portions are to be reassembled into the complete input data. For example, individual input data portions may have been received out of order and the manifest may be used to determine the correct ordering of the input data portions within the complete input data.
  • the checksum values of each of the input data portions identified in the manifest are provided to the execution environment 502 with the call to determine the checksum of the reassembled input data.
  • the execution environment 502 may execute the function to determine the checksum of the reassembled input data by combining the individual checksums, or by determining a checksum of the individual checksum values.
  • the execution environment 502 (or the function running within the execution environment 502) may return the checksum of the reassembled input data to the object storage sendee, as shown in FIG. 10 at (6).
  • the object storage service 160 processes the output of the function.
  • the object storage sendee 160 may perform error detection using the checksum of the reassembled input data, or it may provide the output to the client to enable the client to perform error detection.
  • the object storage sendee 160 may process the output of the function by storing the output as an object within the object data store 166. If an error is detected, the client may re-upload one or more portions of the input data. If no error is detected, the object storage service 160 reassembles the complete input data from the stored input data portions based upon the contents of the manifest.
  • FIG. 10 illustrates the object storage service processing the output of the function and reassembling the complete input data from the stored input data portions at (7).
  • the object storage service 160 can store the reassembled input data as a data object in the object data store 166.
  • FIG. 10 illustrates the object storage service storing the reassembled input data as a data object at (8).
  • Blocks 912 through 916 are illustrated as occurring in sequence. However, the order in which these blocks occur may vary. In some embodiments, the ordering may be different, or two or more block may be performed at the same time, or during at least partially overlapping time periods. For example, in some embodiments, block 912 can be performed concurrently (or partially concurrently) with block 914 and/or block 916. In some embodiments, blocks 914 and 916 may occur before block 912, as well.
  • the routine may terminate at block 918.
  • a client sends a request to an object storage service (such as object storage sendee 160) to write input data or a file as a data object to a storage location, such as an object data store (including object data store 166).
  • an object storage service such as object storage sendee 160
  • the client may wish to store a collection of customer records that include personal customer information (e.g., customer government-issued identification numbers, social security numbers, etc.).
  • the client may wish to obfuscate the customer records prior to storage so that users may only retrieve versions of the customer record s where the persona l customer information has been obfuscated.
  • the client may wish to allow only a small number of users with superior security credentials to have access to the un-obfuscated personal customer information.
  • the input data may include medical images (e.g., photograph, x-ray, sonogram, ultrasound images, etc.), where a portion of the image includes personally identifiable information, such as the patients’ names.
  • the client may wish to obfuscate the personal ly-identifiable information from the medical image.
  • the client request may include the input data, or information usable by the object storage service 160 to obtain the input data.
  • the object storage service 160 may stage the input data in a staging area, such as any of the staging areas discussed above.
  • a routine to obfuscate the input data may be initiated, such as routine 1100 of FIG. 11.
  • FIG. 11 is a flow' diagram of an illustrative routine 1100 that may be executed by a code execution service (or a function running within the execution environment 502), such as the on-demand code execution system 120, to dynamically tokemze, mask, scramble, obscure, encrypt, or otherwise render unintelligible (collectively referred to herein as “obfuscate” for convenience) portions of input data at run time in response to a request to store or write the input data.
  • Obfuscation also includes replacement (e.g., selective replacement) of one or more portions of input data with different, unique data, such as a token.
  • the token for each instance of replaced data e.g., each instance of private information
  • a request to write input data includes request to write or store the input data as a data object in a storage location, such as an object data store, including object data store 166.
  • a client may wish to store a data set that includes both private and non-private information.
  • the client may wish to store the data set in a manner in which the private information is separated from the non-private information, and in which the private information, and a mapping between tokens and private information, are stored in a secure location with access to only a limited number of authorized individuals or resources.
  • the client may also wish to provide access to the non-private information to a larger group of individual or resource, or store the non-private information in a less secure location.
  • FIG. 12 is a system diagram of illustrative data flows and interactions between various components of the sendee provider system 110.
  • the routine 1100 may begin in response to an event, such as when the routine illustrated in FIG. 8 reaches block 808.
  • the routine 1100 may be an owner- defined function, also referred to as a user-defined task, that is performed by a VM instance 150 or other execution environment 502 generated during the routine illustrated in FIG. 8.
  • the routine 1100 or portions thereof may be implemented on multiple processors, serially or in parallel.
  • the VM instance 150 or other execution environment 502 can receive parameters associated with a request to write input data.
  • FIG. 12 illustrates the execution environment 502 (or the function running within the execution environment 502) receiving the parameters associated with the request at (1).
  • the parameters may include: reference data comprising a reference to input data to be stored as a data object; a reference to an output location of the data object; context data regarding the request; other data or metadata; or some combination thereof.
  • the request may be a resource request, such as a PUT request, to store input data as a particular data object in the object storage sendee 160.
  • the reference to the input data may be data that can be used by the execution environment 502 (or the function running within the execution environment 502) to access the input data, such as: a file descriptor; a file handle; a pointer; or some other data representing an address or identifier of the input data.
  • the reference to the output location may be data that can be used by the execution environment 502 (or the function running within the execution environment 502) to write, store, or otherwise persist output data, such as: a file descriptor; a file handle; a pointer; or some other data representing an address or identifier of a location for providing output of the function.
  • the context data or metadata may include data or metadata regarding the context of the request, such as: an identifier of a user, account or other source of the request; an identifier of an access or security profile under which the request is being make; data representing the access or security rights under which the request is to be processed; an identifier of a location associated with the request; an identifier of a language associated with the request; or data representing preferences or tendencies of a source of the request.
  • FIG. 12 depicts the object storage sendee providing parameters such as a reference to a requested data object or reference to an output location to the execution environment 502 (or the function running within the execution environment 502), in other instances these references may be provided by elements of the execution system 120, such as staging code 157
  • the VM instance 150 or other execution environment 502 can obtain the input data to be stored as a data object using the reference data.
  • the input data may be obtained in un obfuscated or substantially un-obfuscated form.
  • FIG. 12 illustrates the execution environment 502 (or the function running within the execution environment 502) obtaining the input data at (2).
  • the input data may not be obtained from the object storage service 160 at block 1104, but may be provided to the execution environment 502 (or the function running within the execution environment 502) previously.
  • the input data may be obtained and stored on a computing device of the execution environment 502 at a location indicated by the reference data.
  • the VM instance 150 or other execution environment 502 can determine that one or more portions of the input data are to be obfuscated in some embodiments, the determination may be based on context data and/or the input data. For example, if a portion of the input data looks like, or is determined to be or to likely be a form of private or personally-identifiable information, the execution environment 502 (or the function running within the execution environment 502) can determine that such portion is to be obfuscated.
  • the execution environment 502 may test one or more items of context data against one or more criteria to determine whether to perform an obfuscation and which portion(s) of the input data to obfuscate. If an item of context data satisfies one or more criteria, then the execution environment 502 (or the function running within the execution environment 502) can determine that one or more portions of the input data are to be obfuscated such that the obfuscated portion(s) render the portions of the input data as unable to be understood by a recipient.
  • FIG. 12 illustrates the execution environment 502 (or the function running within the execution environment 502) determining to obfuscate portions of the input data at (3).
  • Testing the context data against the criteria may include: determining that the input data includes private, or personally identifiable information (including, but not limited to: an individual’s name, address, age, government-issued identification number, social security number, date of birth, place of birth, mother’s maiden name, biometric information, health information, a vehicle identification number (VTN), etc.); or determining that the input data includes information that has been designated confidential.
  • private, or personally identifiable information including, but not limited to: an individual’s name, address, age, government-issued identification number, social security number, date of birth, place of birth, mother’s maiden name, biometric information, health information, a vehicle identification number (VTN), etc.
  • the input data may be a data file, such as a spreadsheet, delimited file, or other collection of data records. Some portions of the data file, such as collections of records, collections of columns or data fields, or the like are to be stored in obfuscated form if the request satisfies one or more criteria.
  • the execution environment 502 (or the function running within the execution environment 502) may determine that properties of the request indicated by the context data or otherwise associated with the request satisfy the criteria for particular records, columns, and/or fields of the requested data object.
  • the execution environment 502 (or the function running within the execution environment 502) may determine, based on this criteria that the particular records, columns, and/or fields of the requested input data are to be obfuscated prior to being output by the function (e.g., for storage as a data object).
  • the VM instance 150 or other execution environment 502 can selectively apply obfuscation to portions of the input data determined above.
  • FIG. 12 illustrates the execution environment 502 (or the function running within the execution environment 502) obfuscating portions of the input data at (4).
  • Obfuscating the content of a portion of the input data may involve the use of one or more obfuscation methods, such as scrambling the content in a pseudo random method, generating a hash of the content, replacing the content with a token mapped to the content m a data store (such as the object storage service 160), encrypting the portion, or the like.
  • encryption is performed using a key under the control of the data object owner and is managed using a key management service.
  • different obfuscation methods may be used for different portions of a data object, different data objects, different context data criteria, or the like.
  • the obfuscation method may include replacing a portion of the input data with a token that is mapped to a key-value pair secured in a secure location, such as an external database.
  • a token that is mapped to a key-value pair secured in a secure location, such as an external database.
  • a social security number “909-09-0909” may be replaced with a globally unique identifier, such as “001,” and a distinct database may store a key-value pair mapping key “001” to “909-09-0909.”
  • the obfuscation method may be specified by an entity that owns or is responsible for the data object requested to be stored (e.g., as part of the request to store the input data as the data object).
  • an entity may specify that particular type of obfuscation (e.g., an industry standard obfuscation method in the medical field) is to he used for a data object or bucket of data objects, while another entity may specify that a different type of obfuscation (e.g., tokenization using a mapping of tokens to data) is to be used for a different data object or bucket of data objects.
  • a different type of obfuscation e.g., tokenization using a mapping of tokens to data
  • the VM instance 150 or other execution environment 502 can provide the selectively- obfuscated input data as output of the function.
  • the execution environment 502 (or the function running within the execution environment 502) can place the selectively- obfuscated input data at the output location indicated by the reference data, and finalize the output.
  • Finalizing output of the function may include closing the output stream or file identified by the reference to the output location and/or providing a return value (e.g., indicating success, failure, or some other characteristics of function execution) to the object storage service 160.
  • the VM instance 150 or other execution environment 502, or the function running within the execution environment 502 can also provide an index as second output data.
  • the index may include a mapping between tokens and obfuscated private information.
  • the index may be subsequently stored using the object storage service, a different object storage service, or a different storage service, such as a database storage service, or any other storage service.
  • FIG. 12 illustrates the execution environment 502 (or the function running within the execution environment 502) providing the selectively- obfuscated input data as output at (5).
  • the routine 1100 may terminate at block 1112.
  • Obfuscation of data object portions at write provides certain data management advantages. For example, if input data includes customer records, such as purchase history, personally identifiable information, and other private and non-private information, a data object including obfuscated versions of that information may be more easily updated if a particular customer deletes her account. For example, instead of having to scan through an entire data object to locate and remove all of the deleted customer’s private information, the system can instead delete the mapping of tokens associated with the deleted customer from the token mapping table (or mapping of tokens to key-value pairs, as discussed above) or delete the customer’s private information from the location in which such private information is stored.
  • the token mapping table or mapping of tokens to key-value pairs, as discussed above
  • FIG. 13 is a flow diagram of an illustrative routine 1300 that may be executed by a code execution service, such as the on-demand code execution system 120, to dynamically determine and store, at run time, an index of the contents of input data in response to a request to store the input data as a data object.
  • a code execution service such as the on-demand code execution system 120
  • a client may wish to retrieve only a portion of a composite file stored as a data object in an object storage service.
  • the object storage service is able to retrieve and provide to the client only the desired portions.
  • FIG. 14 is a system diagram of illustrative data flows and interactions between various components of the service provider system 110.
  • a client sends a request to an object storage service (such as object storage service 160) to write input data as a data object at a storage location, such as an object data store (including object data store 166).
  • an object storage service such as object storage service 160
  • the client may wish to store input data that includes a composite file, such as a compressed file, sometimes referred to as a .zip archive, a .tar archive, or a compressed file, or other file made up of a collection of individual data elements.
  • the composite file may include one or more individual files, each of which is compressed.
  • the composite file may also include an index of the contents of the composite file. The index may include the names of each of the individual files within the composite file, as w r ell as other metadata regarding the composite file’s contents.
  • the index may also provide a mapping between the contents of the composite file and the byte- range location of each of the contents. There index, therefore, enables a user to use a “byte-range GET” to request only the bytes for a certain desired file, or other content of the composite file.
  • the composite file does not include an index of the composite file’s contents.
  • the input data is not a composite file, but the object storage sendee 160 is configured to generate a storable data object that corresponds to a compressed version of the input data, and to store the compressed version within the object storage sendee.
  • the client request may include the input data, or information usable by the object storage service 160 to obtain the input data.
  • the object storage sendee 160 may stage the input data in a staging area, such as any of the staging areas discussed above. Once the object has been staged, a routine to index the input data may be initiated, such as routine 1100 of FIG. 13.
  • the routine 1300 may begin in response to an event, such as when the routine illustrated in FIG. 8 reaches block 808.
  • the routine 1300 may be an owner- defined function, also referred to as a user-defined task, that is performed by a VM instance 150 or other execution environment 502 generated during the routine illustrated in FIG. 8.
  • the routine 1300 or portions thereof may be implemented on multiple processors, serially or in parallel.
  • the VM instance 150 or other execution environment 502 can receive parameters associated with a request to store input data as a data object.
  • FIG. 14 illustrates the execution environment 502 (or the function running within the execution environment 502) receiving the parameters associated with the request at (1).
  • the parameters may include: reference data comprising a reference input data to be stored as a data object; a reference to an output location of the data object; context data regarding the request; other data or metadata; or some combination thereof.
  • the request may be a resource request, such as a PUT request, to store input data as a particular data object in the object storage sendee 160.
  • the reference to the input data may be data that can be used by the execution environment 502 (or the function running within the execution environment 502) to access the input data, such as: a file descriptor; a file handle; a pointer; or some other data representing an address or identifier of the input data.
  • the reference to the output location may be data that can be used by the execution environment 502 (or the function running within the execution environment 502) to write, store, or otherwise persist output data, such as: a file descriptor; a file handle; a pointer; or some other data representing an address or identifier of a location for providing output of the function.
  • the context data or metadata may include data or metadata regarding the context of the request, such as: an identifier of a user, account or other source of the request; an identifier of an access or security profile under which the request is being make; data representing the access or security rights under which the request is to be processed; an identifier of a location associated with the request; an identifier of a language associated with the request; or data representing preferences or tendencies of a source of the request. While FIG. 14 depicts the object storage sendee providing parameters such as a reference to a requested data object or reference to an output location to the execution environment 502 (or the function running within the execution environment 502), in other instances these references may be provided by elements of the execution system 120, such as staging code 157.
  • the VM instance 150 or other execution environment 502 can obtain the input data using the reference data.
  • FIG. 14 illustrates the execution environment 502 obtaining the input data at (2).
  • the input data may not be obtained from the object storage service 160 at block 1104, but may be provided to the execution environment 502 (or the function running within the execution environment 502) previously.
  • the input data may be obtained and stored on a computing device of the execution environment 502 at a location indicated by the reference data.
  • the VM instance 150 or other execution environment 502 for the function running within the execution environment 502) generates an index of the input data’s contents.
  • the index is generated by obtaining the names of the individual files stored within the input data.
  • the input data may include an index of the data object’s contents. If not, the execution environment 502 (or the function running within the execution environment 502) can read and store the names of each file within the input data.
  • the files within the input data are extracted or decompressed so the file names and/or file contents may be determined.
  • the execution environment 502 (or the function running within the execution environment 502) generates an index of the input data’s contents using metadata or headers stored within the input data.
  • the VM instance 150 or other execution environment 502 (or the function running within the execution environment 502) is configured to un-pack, or recursively un pack the input data to determine its contents (e.g , identifiers of delineated elements within the input data, and the byte-range locations of the delineated elements within the input data, the delineated elements being files, or any other delineated element described herein).
  • Recursive unpacking can include analyzing a second composite file that is located within a first file.
  • the VM instance 150 or other execution environment 502 can unpack the first file to identify the second file (or second files), and then unpack the second file to determine identifiers of delineated elements and byte- range (or other) locations within the second file.
  • the execution environment 502 (or the function running within the execution environment 502) generates an index of the input data’s contents by analyzing the text within the input data.
  • the index includes content identifiers (e.g., file names, text fields, header information, metadata, etc.) as well as location information associated with each identifier.
  • the index can include a list of all files within the input data, as well as the location (e.g., byte range, etc.) of each file within the input data.
  • the index can include a list of all the headers of the data sets within the input data (e.g., the sales data for various geographic regions), as well as the location of each data set within the input data (e.g., byte range, etc.).
  • the VM instance 150 or other execution environment 502 can determine a file aggregation technique used to form the composite file.
  • the VM instance 150 or other execution environment 502 may determine whether the composite file is a .zip, .tar, or other format by analyzing bytes within the file. For example, some aggregations techniques generate files having known header formats. Therefore, the VM instance 150 or other execution environment 502 (or the function running within the execution environment 502) can dynamically evaluate the input data based upon the bytes (sometimes referred to as file aggregation technique information), and use that information to determine how to further read and interpret the rest of the input data. For example, the file aggregation technique information may be used to determine whether to perform recursive unpacking of a file, such as discussed above.
  • FIG. 14 illustrates the execution environment 502 (or the function running within the execution environment 502) determining an index of the input data contents at (3).
  • the VM instance 150 or other execution environment 502 can provide the index as output of the function.
  • the execution environment 502 (or the function running within the execution environment 502) can may return the index to the object storage service 160.
  • the VM instance 150 or other execution environment 502 (or the function running within the execution environment 502) can return the input data instead of, in addition to (as second output data), or combined with the index.
  • FIG. 14 illustrates the execution environment 502 (or the function running within the execution environment 502) providing the index as output at (4).
  • the object storage service 160 can process the function output.
  • the object storage service 160 (or a different service) may store the index.
  • FIG. 14 illustrates the object storage service 160 storing the index at (5).
  • the index may be stored at any of a variety of locations.
  • the object storage service 160 may store the index in an object data store, such as the object data store 166 of the object storage service 160.
  • the object storage service 160 may store the index as a table using a relational or non-relational data storage service or database management system.
  • the index may be appended to or otherwise added to the input data, and the updated input data (with index) may be stored by the object storage service 160.
  • the object storage service 160 may create a data object corresponding to the input data and to add metadata to the data object that includes a reference to the index.
  • the reference can include an indication that there is an index associated with the data object.
  • the data object corresponding to the input data and the index may be associated with each other via a naming convention.
  • the data object and the index may have similar identifier or name portions, such as a prefix, suffix, or other identifier.
  • the reference may be used by a subsequent user of the data object to obtain a desired portion of the data object. For example, a user may retrieve the index and select a desired portion of the data object.
  • the object storage service 160 and execution environment 502 may use the desired portion indicated by the user and the index to identify the location within the data object (e.g., byte range) of the desired portion of the data object.
  • the object storage sendee 160 and execution environment 502 may use the location to retrieve, e.g., extract or decompress, the desired portion of the data object (e.g., via executing a byte-range query or GET, etc. on the stored data object) and provide it to the user.
  • the routine may terminate at block 1312.
  • FIG. 14 illustrates the execution environment 502 (or the function running within the execution environment 502) indexing a data object for storage in the object storage service 160 in response to receiving a request to store the data object.
  • the just-in- time transformation is shown as occurring in connection with operations of routine 1300 for indexing the data object just-in-time transformations may be performed in connection with any of the other routines described herein, with any other owner-defined function or user- defined task, in a pipeline with multiple functions, etc.
  • a system comprising: an object storage service comprising one or more computing devices, wherein the object storage service is configured to store a plurality of data objects within an object data store; and a code execution service comprising one or more computing devices for on-demand execution of functions in an input/output (I/O) path of the object storage sendee; wherein the object storage service is configured to at least: receive input data and a request to store the input data as a data object within the object data store; determine that a function to obfuscate a portion of the input data, associated with the request to store the input data, is to be executed prior to storing the input data as the data object; and transmit a call to the code execution sendee to execute the function against the input data; and wherein the code execution service is configured to at least: receive, from the object storage service, the call to execute the function, the call including the input data; and execute the function, wherein executing the function causes the service to: identify, within the input data, one or more instances of private information that is to be
  • Clause 3 The system of Clause 1, wherein the code execution service is configured to generate the output data by: determining a unique token for each instance of the private information, wherein each unique token is different from every other unique token; storing the instances of the private information and a mapping of the unique tokens to the instances of the private information; and replacing each instance of the private information with the corresponding unique token.
  • Clause d The system of Clause 1, wherein the code execution sendee is configured to generate the obfuscated form of the private information by encrypting the private information.
  • a computer-implemented method comprising: under control of a computing system comprising one or more computer processors configured to execute specific instructions, receiving a request to store input data as a data object within a data store; determining, based at least partly on the request, to execute a function to obfuscate a portion of the input data prior to storing the input data as the data object; configuring a code execution system to execute the function, wherein the code execution system is configured to provide on-demand execution of functions in an input/output (I/O) path of the data store; executing the function using the code execution system prior to storing the input data as the data object, wherein executing the function comprises: obtaining the input data; determining to obfuscate a first portion of the input data; generating a first obfuscated portion comprising the first portion in obfuscated form; and generating a output data comprising the first obfuscated portion, wherein the output data does not include the first portion in un
  • Clause 6 The computer-implemented method of Clause 5, wherein determining to obfuscate a first portion of the input data comprises determining that the first portion includes private information.
  • Clause 7 The computer-implemented method of Clause 6, wherein the private information represents one or more of: personally identifiable information, a name, an address, an age, a government-issued identification number, a date of birth, a place of birth, a mother’s maiden name, an account number, or a biometric record.
  • Clause 8 The computer-implemented method of Clause 5, wherein generating the first obfuscated portion comprises: determining a unique token corresponding to the first portion; storing a mapping of the token to the first portion; and replacing the first portion with the unique token.
  • Clause 9 The computer-implemented method of Clause 8, wherein storing the mapping of the token to the first portion comprises storing the mapping of the token to the first portion in a storage location having different access permissions than a location in the data store in which the data object is stored.
  • Clause 10 The computer-implemented method of Clause 5, wherein generating the first obfuscated portion comprises encrypting the first portion of the input data using an encryption key.
  • Clause 11 The computer-implemented method of Clause 10, further comprising storing the encry ption key and a mapping of the encryption key to the first obfuscated portion.
  • Clause 12 The computer-implemented method of Clause 5, wherein determining to obfuscate the first portion of the input data is based at least in part upon a portion of the input data.
  • a system comprising: a data store storing plurality of data objects; and one or more computing devices in communication with the data store and configured to at least: receive a request to store input data as a data object within a data store; determine, based at least partly on the request, to execute a function to obfuscate a portion of the input data prior to storing the input data as the data object; configure a code execution system to execute the function, wherein the code execution system is configured to provide on-demand execution of functions in an input/output (I/O) path of the data store; execute the function using the code execution system prior to storing the input data as the data object, wherein executing the function comprises: obtaining the input data; determining to obfuscate a first portion of the input data; generating a first obfuscated portion comprising the first portion in obfuscated form; and generating a output data comprising the first obfuscated portion, wherein the output data does not include the first portion in
  • Clause 14 The system of Clause 13, wherein the one or more computing devices are further configured to determine to obfuscate the first portion of the input data by determining that the first portion includes private information.
  • Clause 15 The system of Clause 14, wherein the private information represents one or more of: personally identifiable information, a name, an address, an age, a government- issued identification number, a date of birth, a place of birth, a mother’s maiden name, an account number, or a biometric record.
  • Clause 16 The system of Clause 13, wherein the one or more computing devices are further configured to generate the first obfuscated portion by: determining a unique token corresponding to the first portion; storing a mapping of the token to the first portion; and replacing the first portion with the unique token. Clause 17. The system of Clause 16, wherein the one or more computing devices are further configured to generate the first obfuscated portion by storing the mapping of the token to the first portion in a storage location having different access permissions than a location in the data store in which the data object is stored.
  • Clause 18 The system of Clause 13, wherein the one or more computing devices are further configured to generate the first obfuscated portion by encrypting the first portion of the input data using an encryption key.
  • Clause 19 The system of Clause 18, wherein the one or more computing devices are further configured to store the encryption key and a mapping of the encryption key to the first obfuscated portion.
  • Clause 20 The system of Clause 13, wherein the one or more computing devices are further configured to determine to obfuscate the first portion of the input data based at least in part upon a portion of the input data.
  • a system comprising: an object storage service comprising one or more computing devices, wherein the object storage sendee is configured to store a plurality of data objects within an object data store; and a code execution service comprising one or more computing devices for on-demand execution of functions in an input/output (I/O) path of the object storage sendee; wherein the object storage sen-ice is configured to at least: receive from a client: (1) input data as a plurality of input data portions, and (2) a request to store the input data portions as data object portions within the object data store; determine that a first function to generate a checksum value for an input data portion, associated with the request to store the input data portion, is to be executed for each input data portion; and transmit a first call to the code execution service to execute the first function against the input data portion for each of the input data portions; and wherein the code execution service is configured to at least: receive, from the object storage service, the first call to execute the first function on the input data portion; and execute the first function, wherein executing
  • Clause 2 The system of Clause 1, wherein executing the first function causes the code execution service to generate the individual checksum value for the input data portion by performing a cyclical redundancy check using the input data portion, and wherein executing the second function causes the code execution service to generate the checksum value for the reassembled input data by performing a cyclical redundancy check using the individual checksum data objects.
  • Clause 3 The system of Clause 1, wherein the object storage service is further configured to store the second output data as metadata to the data object.
  • Clause 4 The system of Clause 1, wherein the object storage service is further configured to determine that one or more input data portions have been received with errors, based on the individual checksum data objects and provide information to the client regarding whether one or more input data portions have been received with errors.
  • a computer-implemented method comprising: under control of a computing system comprising one or more computer processors configured to execute specific instructions, receiving input data from a client as a plurality of input data portions via individual upload processes, and a request to store the input data portions as data object portions within a data store; determining, based at least partly on the request, to execute a first function for each input data portion prior to confirming storage of the input data portion as the data object portion; executing the first function using a code execution system for each of the input data portions, wherein the code execution system provides on-demand execution of functions designated in an input/output (I/O) path of the data store, wherein executing the first function comprises: obtaining the input data portion; performing the first function to generate a first function value for the input data portion; and returning the first function value; storing the first function value; receiving a request to assemble at least some of the input data portions into reassembled input data; determining, based at least partly on the request, to execute a second function for the
  • Clause 6 The computer-implemented method of Clause 5, further comprising determining that a particular input data portion was received with errors by using the first function value, and providing information to the client regarding whether one or more input data portions have been received with errors.
  • Clause 7 The computer-implemented method of Clause 5, further comprising providing the first function value to the client to enable the client to perform error detection on the input data portions.
  • Clause 8 The computer-implemented method of Clause 5, wherein performing the first function comprises generating an individual checksum value by performing a cyclical redundancy check using the input data portion, and wherein performing the second function comprises generating a checksum value for the reassembled input data by performing a cyclical redundancy check using at least some of the individual checksum values.
  • Clause 9 The computer-implemented method of Clause 5, further comprising reassembling the input data using the input data portions and storing the reassembled input data in the data store as a data object.
  • Clause 10 The computer-implemented method of Clause 9, wherein storing the second output data comprises storing the second output data as metadata to the data object.
  • Clause 11 The computer-implemented method of Clause 9, wherein determining, based at least partly on the request, to execute the second function for the reassembled input data portion comprises determining, based at least partly on the request, to execute the second function for the reassembled data portion prior to reassembling the data input.
  • each input data portion comprises a plurality of input data parts, each input data part having a fixed size
  • executing the first function for each of the input data portions comprises executing the first function for each input data part of each input data portion.
  • a system comprising: a data store configured to store a plurality of data objects; and one or more computing devices in communication with the data store and configured to at least: receive input data from a client as a plurality of input data portions via individual upload processes, and a request to store the input data portions as data object portions within a data store; determine, based at least partly on the request, to execute a first function for each input data portion prior to storing the input data portion as the data object portion; execute the first function using a code execution system for each of the input data portions, wherein the code execution system provides on-demand execution of functions designated in an input/output (I/O) path of the data store, wherein executing the first function comprises: obtaining the input data portion; performing the first function to generate a first function value for the input data portion; and returning the first function value; storing the first function value; receive a request to assemble at least some of the input data portions into reassembled input data; determine, based at least partly on the request, to execute a second function for
  • Clause 14 The system of Clause 13, wherein the code execution system is further configured to determine that a particular input data portion was received with errors by using the first function value, and provide information to the client regarding whether one or more input data portions have been received with errors.
  • Clause 15 The system of Clause 13, wherein the code execution service is configured to provide the first function value to the client to enable the client to perform error detection on the input data portions.
  • Clause 16 The system of Clause 13, wherein the code execution service is further configured to perform the first function to generate an individual checksum value by performing a cyclical redundancy check using the input data portion, and perform the second function to generate a checksum value for the reassembled input data by performing a cyclical redundancy check using at least some of the individual checksum values.
  • Clause 17 The system of Clause 13, wherein the one or more computing devices is further configured to reassemble the input data using the input data portions and store the reassembled input data in the data store as a data object.
  • Clause 18 The system of Clause 17, wherein the one or more computing devices is further configured to store the second output data as metadata to the data object.
  • Clause 19 The system of Clause 17, wherein the code execution service is further configured to determine, based at least partly on the request, to execute the second function for the reassembled input data portion by determining, based at least partly on the request, to execute the second function for the reassembled data portion prior to reassembling the data input.
  • each input data portion comprises a plurality of input data parts, each input data part having a fixed size
  • the code execution service is configured to execute the first function for each of the input data portions by executing the first function for each input data part of each input data portion.
  • a system comprising: an object storage service comprising one or more computing devices, wherein the object storage sendee is configured to store a plurality of data objects; and a code execution service comprising one or more computing devices for on-demand execution of functions in an input/output (I/O) path of the object storage sendee; wherein the object storage service is configured to at least: receive input data and a request to store the input data as a data object within the object data store, the input data comprising a composite file, wherein the composite file comprises a plurality of individual files and, for each of the individual files, a file identifier and byte range location information identifying a byte range location of the individual file within the composite file; determine that a function to create an index by extracting the file identifiers and byte range location information from the input data, associated with the request to store the input data, is to be executed prior to storing the input data as the data object; and transmit a call to the code execution service to execute the function against the input data; and wherein the code
  • Clause 2 The system of Clause 1, wherein the code execution service is further configured to determine file aggregation technique information associated with the composite file, and extract the file identifiers and byte range location information from the input data using the file aggregation technique information.
  • Clause 3 The system of Clause 1, wherein the first data object is associated with the output data via a naming convention, or by including metadata with the first data object that references the second data object.
  • Clause 4 The system of Clause 1, wherein the index enables the client to retrieve a desired portion of the composite file from the data store without having to retrieve the entire data object from the object data store.
  • a computer-implemented method comprising: under control of a computing system comprising one or more computer processors configured to execute specific instructions, receiving a request to store input data as a data object within in a data store, the input data comprising a collection of delineated elements; determining, based at least partly on the request, to execute a function to generate an index mapping element identifiers and element locations for each delineated element prior to storing the input data as the data object; configuring a code execution system to execute the function, wherein the code execution system provides on-demand execution of functions in an input/output (I/O) path of the data store; executing the function using the code execution system prior to storing the input data as the data object, wherein executing the function comprises: obtaining the input data; generating an index mapping the element identifiers and element locations within the input data; and returning the index as output data; and storing the output data separately from and associated with the data object.
  • Clause 6 The computer-implemented method of Clause 5, further comprising decompressing the input data prior to generating the index.
  • Clause 7 The computer- implemented method of Clause 5, wherein generating the index comprises extracting the element identifiers and element locations from the input data.
  • Clause 8 The computer-implemented method of Clause 5, further comprising generating the element identifiers, the element locations, or both, using the delineated elements.
  • Clause 9 The computer-implemented method of Clause 5, wherein storing the output data separately from the data object comprises storing the output data as a second data object that may be independently accessed from within the data store.
  • Clause 10 The computer-implemented method of Clause 5, wherein storing the output data comprises storing the output data within a database using a data storage service.
  • Clause 11 The computer-implemented method of Clause 5, wherein the delineated elements include one or more of rows, lines, files, comma separated values, or columns of data.
  • Clause 12 The computer-implemented method of Clause 5, further comprising compressing the input data and storing the compressed input data as the data object.
  • a system comprising: a data store configured to store a plurality of data objects; and one or more computing devices in communication with the data store and configured to at least: receive a request to store input data as a data object within the data store, the input data comprising a collection of delineated elements; determ ine, based at least partly on the request to execute a function to generate an index mapping element identifiers and element locations for each delineated element prior to storing the input data as the data object; configure a code execution service to execute the function, wherein the code execution sendee is thereby configured to: obtain the input data; generate an index mapping the element identifiers and element locations within the input data; and return the index as output data; and store the output data separately from and associated with the data object.
  • Clause 14 The system of Clause 13, wherein the code execution system is further configured to decompress the input data prior to generating the index.
  • Clause 15 The system of Clause 13, wherein the code execution sendee is configured to generate the index by extracting the element identifiers and element locations from the input data.
  • Clause 16 The system of Clause 13, wherein the code execution service is further configured to generate the element identifiers, the element locations, or both, using the delineated elements.
  • Clause 17 The system of Clause 13, wherein the one or more computing devices is further configured to store the output data separately from the data object by storing the output data as a second data object that may be independently accessed from within the data store.
  • Clause 18 The system of Clause 13, wherein the one or more computing devices is further configured to store the output data by storing the output data within a database using a data storage service.
  • Clause 19 The system of Clause 13, wherein the delineated elements include one or more of rows, lines, files, comma separated values, or columns of data.
  • Clause 20 The system of Clause 13, wherein the one or more computing devices is further configured to compress the input data and store the compressed input data as the data object.
  • All of the methods and processes described above may be embodied in, and fully automated via, software code modules executed by one or more computers or processors.
  • the code modules may be stored in any type of non-transitory computer-readable medium or other computer storage device. Some or all of the methods may alternatively be embodied in specialized computer hardware.
  • Disjunctive language such as the phrase “at least one of X, Y or Z,” unless specifically stated otherwise, is otherwise understood with the context as used in general to present that an item, term, etc., may be either X, Y or Z, or any combination thereof (e.g., X, Y or Z). Thus, such disjunctive language is not generally intended to, and should not, imply that certain embodiments require at least one of X, at least one of Y or at least one of Z to each be present.
  • a device configured to are intended to include one or more recited devices. Such one or more recited devices can also be collectively configured to carry out the stated recitations.
  • a processor configured to carry out recitations A, B and C can include a first processor configured to carry out recitation A working in conj unction with a second processor configured to carry out recitations B and C.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Bioethics (AREA)
  • Data Mining & Analysis (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • Medical Informatics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

Une entrée et une sortie (E/S) associées à un service de mémorisation d'objets sont modifiées par la mise en œuvre d'une ou de plusieurs fonctions spécifiées par le propriétaire par rapport à des demandes d'E/S. Une fonction peut mettre en œuvre une manipulation de données, telle qu'un filtrage de données sensibles avant la lecture ou l'écriture des données. Les fonctions peuvent être appliquées avant la mise en œuvre d'un procédé de demande (par exemple, GET ou PUT) spécifié dans la demande d'E/S, de sorte qu'il se peut que les données auxquelles est appliqué le procédé ne correspondent pas à l'objet spécifié dans la demande. Par exemple, un utilisateur peut demander l'obtention (par exemple, GET) d'un ensemble de données. L'ensemble de données peut être transmis à une fonction qui filtre des données sensibles par rapport à l'ensemble de données, et le procédé de demande GET peut ensuite être appliqué à la sortie de la fonction. De cette manière, une plus grande maîtrise d'objets mémorisés dans le service ou récupérés à partir de ce dernier est fournie à des propriétaires d'objets d'un service de mémorisation d'objets.
EP20786675.7A 2019-09-27 2020-09-23 Obscurcissement de code à la demande de données dans un trajet d'entrée d'un service de mémorisation d'objets Pending EP4035047A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
US16/586,816 US11386230B2 (en) 2019-09-27 2019-09-27 On-demand code obfuscation of data in input path of object storage service
US16/586,818 US10996961B2 (en) 2019-09-27 2019-09-27 On-demand indexing of data in input path of object storage service
US16/586,825 US11023311B2 (en) 2019-09-27 2019-09-27 On-demand code execution in input path of data uploaded to storage service in multiple data portions
PCT/US2020/052280 WO2021061820A1 (fr) 2019-09-27 2020-09-23 Obscurcissement de code à la demande de données dans un trajet d'entrée d'un service de mémorisation d'objets

Publications (1)

Publication Number Publication Date
EP4035047A1 true EP4035047A1 (fr) 2022-08-03

Family

ID=72753024

Family Applications (1)

Application Number Title Priority Date Filing Date
EP20786675.7A Pending EP4035047A1 (fr) 2019-09-27 2020-09-23 Obscurcissement de code à la demande de données dans un trajet d'entrée d'un service de mémorisation d'objets

Country Status (3)

Country Link
EP (1) EP4035047A1 (fr)
CN (1) CN114586020A (fr)
WO (1) WO2021061820A1 (fr)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11394761B1 (en) 2019-09-27 2022-07-19 Amazon Technologies, Inc. Execution of user-submitted code on a stream of data
US11550944B2 (en) 2019-09-27 2023-01-10 Amazon Technologies, Inc. Code execution environment customization system for object storage service
US11656892B1 (en) 2019-09-27 2023-05-23 Amazon Technologies, Inc. Sequential execution of user-submitted code and native functions
US11416628B2 (en) 2019-09-27 2022-08-16 Amazon Technologies, Inc. User-specific data manipulation system for object storage service based on user-submitted code
US11360948B2 (en) 2019-09-27 2022-06-14 Amazon Technologies, Inc. Inserting owner-specified data processing pipelines into input/output path of object storage service
US11263220B2 (en) 2019-09-27 2022-03-01 Amazon Technologies, Inc. On-demand execution of object transformation code in output path of object storage service
US11550955B1 (en) * 2021-07-20 2023-01-10 Red Hat, Inc. Automatically anonymizing data in a distributed storage system
CN114218597B (zh) * 2021-12-30 2023-10-10 北京荣达天下信息科技有限公司 一种适用于企业内部隐私数据保密的方法及系统

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012145825A1 (fr) * 2011-04-27 2012-11-01 Perspecsys Inc. Système et procédé d'obscurcissement de données lors de l'interception d'une communication avec un nuage
CA2775427A1 (fr) * 2011-04-27 2012-10-27 Perspecsys Inc. Systeme et methode d'interception et de conversion de donnees dans un serveur mandataire
US9323556B2 (en) * 2014-09-30 2016-04-26 Amazon Technologies, Inc. Programmatic event detection and message generation for requests to execute program code
US10887291B2 (en) * 2016-12-16 2021-01-05 Amazon Technologies, Inc. Secure data distribution of sensitive data across content delivery networks
US20180285591A1 (en) * 2017-03-29 2018-10-04 Ca, Inc. Document redaction with data isolation

Also Published As

Publication number Publication date
CN114586020A (zh) 2022-06-03
WO2021061820A1 (fr) 2021-04-01

Similar Documents

Publication Publication Date Title
US11386230B2 (en) On-demand code obfuscation of data in input path of object storage service
EP4034998B1 (fr) Système de manipulation de données spécifiques à un utilisateur destiné à un service de stockage d'objets basé sur un code soumis par l'utilisateur
US11860879B2 (en) On-demand execution of object transformation code in output path of object storage service
US11023311B2 (en) On-demand code execution in input path of data uploaded to storage service in multiple data portions
US10996961B2 (en) On-demand indexing of data in input path of object storage service
US10908927B1 (en) On-demand execution of object filter code in output path of object storage service
US11023416B2 (en) Data access control system for object storage service based on owner-defined code
EP4035047A1 (fr) Obscurcissement de code à la demande de données dans un trajet d'entrée d'un service de mémorisation d'objets
US11106477B2 (en) Execution of owner-specified code during input/output path to object storage service
US11550944B2 (en) Code execution environment customization system for object storage service
US11416628B2 (en) User-specific data manipulation system for object storage service based on user-submitted code
CN114586010B (zh) 对象存储服务的输出路径中对象过滤代码的按需执行
US11055112B2 (en) Inserting executions of owner-specified code into input/output path of object storage service
US11250007B1 (en) On-demand execution of object combination code in output path of object storage service
US11360948B2 (en) Inserting owner-specified data processing pipelines into input/output path of object storage service
US9489395B2 (en) System and method for exposing cloud stored data to a content delivery network
CN114586011B (zh) 将所有者指定的数据处理流水线插入到对象存储服务的输入/输出路径
US9824233B2 (en) Posixly secure open and access files by inode number
US11394761B1 (en) Execution of user-submitted code on a stream of data
US11656892B1 (en) Sequential execution of user-submitted code and native functions
US11966370B1 (en) Pseudo-local multi-service enabled file systems using a locally-addressable secure compute layer
CN111680003B (zh) 基于分布式的文件中心系统及文件管理方法

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20220421

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR

DAV Request for validation of the european patent (deleted)
DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: EXAMINATION IS IN PROGRESS

RIC1 Information provided on ipc code assigned before grant

Ipc: G06F 16/958 20190101ALI20240619BHEP

Ipc: G06F 9/455 20180101ALI20240619BHEP

Ipc: G06F 21/62 20130101AFI20240619BHEP

17Q First examination report despatched

Effective date: 20240719