Abstract: Methods, systems, and computer-readable media for global column indexing in a graph database are disclosed. A plurality of data elements of a graph database are stored. The triples comprise identifiers, column names, and values. The column names are globally scoped in the graph database and are associated with data types. Indices corresponding to the column names are created. A particular one of the indices comprises one or more of the values associated with the corresponding column name. A query is performed on the graph database using one or more of the indices corresponding to one of more of the column names associated with the query.

Abstract: Methods, systems, and computer-readable media for query language interoperability in a graph database are disclosed. Data elements are inserted into a graph database using one or more of a plurality of graph database query languages. The graph database query languages comprise a first graph database query language associated with a first data model and a second graph database query language associated with a second data model. The data elements are stored in the graph database using an internal data model that differs from the first and second data models. One or more of the data elements are retrieved from the graph database based at least in part on a query. The query is expressed using a different graph database query language than the graph database query language used to insert the one or more retrieved data elements.

Abstract: Methods, systems, and computer-readable media for global column indexing in a graph database are disclosed. A plurality of data elements of a graph database are stored. The triples comprise identifiers, column names, and values. The column names are globally scoped in the graph database and are associated with data types. Indices corresponding to the column names are created. A particular one of the indices comprises one or more of the values associated with the corresponding column name. A query is performed on the graph database using one or more of the indices corresponding to one of more of the column names associated with the query.

Abstract: Methods, systems, and computer-readable media for query language interoperability in a graph database are disclosed. Data elements are inserted into a graph database using one or more of a plurality of graph database query languages. The graph database query languages comprise a first graph database query language associated with a first data model and a second graph database query language associated with a second data model. The data elements are stored in the graph database using an internal data model that differs from the first and second data models. One or more of the data elements are retrieved from the graph database based at least in part on a query. The query is expressed using a different graph database query language than the graph database query language used to insert the one or more retrieved data elements.

Abstract: Methods, systems, and computer-readable media for global column indexing in a graph database are disclosed. A plurality of data elements of a graph database are stored. The triples comprise identifiers, column names, and values. The column names are globally scoped in the graph database and are associated with data types. Indices corresponding to the column names are created. A particular one of the indices comprises one or more of the values associated with the corresponding column name. A query is performed on the graph database using one or more of the indices corresponding to one of more of the column names associated with the query.

Abstract: Methods, systems, and computer-readable media for query language interoperability in a graph database are disclosed. Data elements are inserted into a graph database using one or more of a plurality of graph database query languages. The graph database query languages comprise a first graph database query language associated with a first data model and a second graph database query language associated with a second data model. The data elements are stored in the graph database using an internal data model that differs from the first and second data models. One or more of the data elements are retrieved from the graph database based at least in part on a query. The query is expressed using a different graph database query language than the graph database query language used to insert the one or more retrieved data elements.

Abstract: Systems and techniques are described herein for tiered storage of customer data accessed by a search service of a computing resource service provider. In some aspects, customer data may be received by a search instance executed across a plurality of compute nodes and provisioned by a search service. The customer data may be indexed and the data and resulting index may be stored locally by a first pool of hot compute nodes of the search instance. The customer data and index may be migrated and stored remotely by a data storage service. Metadata associated with the customer data and/or index may be stored in a second pool of warm compute nodes of the search instance. The warm compute nodes, upon receiving a request to access the customer data, may identify a location of the customer data and retrieve the customer data from the data storage service according to the metadata.

Abstract: Methods, systems, and computer-readable media for global column indexing in a graph database are disclosed. A plurality of data elements of a graph database are stored. The triples comprise identifiers, column names, and values. The column names are globally scoped in the graph database and are associated with data types. Indices corresponding to the column names are created. A particular one of the indices comprises one or more of the values associated with the corresponding column name. A query is performed on the graph database using one or more of the indices corresponding to one of more of the column names associated with the query.

Abstract: Methods, systems, and computer-readable media for query language interoperability in a graph database are disclosed. Data elements are inserted into a graph database using one or more of a plurality of graph database query languages. The graph database query languages comprise a first graph database query language associated with a first data model and a second graph database query language associated with a second data model. The data elements are stored in the graph database using an internal data model that differs from the first and second data models. One or more of the data elements are retrieved from the graph database based at least in part on a query. The query is expressed using a different graph database query language than the graph database query language used to insert the one or more retrieved data elements.

Abstract: Methods, systems, and computer-readable media for global column indexing in a graph database are disclosed. A plurality of data elements of a graph database are stored. The triples comprise identifiers, column names, and values. The column names are globally scoped in the graph database and are associated with data types. Indices corresponding to the column names are created. A particular one of the indices comprises one or more of the values associated with the corresponding column name. A query is performed on the graph database using one or more of the indices corresponding to one of more of the column names associated with the query.

Abstract: Methods, systems, and computer-readable media for query language interoperability in a graph database are disclosed. Data elements are inserted into a graph database using one or more of a plurality of graph database query languages. The graph database query languages comprise a first graph database query language associated with a first data model and a second graph database query language associated with a second data model. The data elements are stored in the graph database using an internal data model that differs from the first and second data models. One or more of the data elements are retrieved from the graph database based at least in part on a query. The query is expressed using a different graph database query language than the graph database query language used to insert the one or more retrieved data elements.

Abstract: Methods, systems, and computer-readable media for global column indexing in a graph database are disclosed. A plurality of data elements of a graph database are stored. The triples comprise identifiers, column names, and values. The column names are globally scoped in the graph database and are associated with data types. Indices corresponding to the column names are created. A particular one of the indices comprises one or more of the values associated with the corresponding column name. A query is performed on the graph database using one or more of the indices corresponding to one of more of the column names associated with the query.

Abstract: A web server is able to efficiently host multiple web sites. Since overhead is significantly reduced, the server can accommodate a large number of concurrent users without service delays or disruptions, even under heavy load conditions. A persistent controller process executes on the server, and responsively to a user request for access to a resource of one of the clients, a child process is spawned. The user request is then served using the child process.

Abstract: A server is capable of receiving large numbers of concurrent download requests, establishing TCP sessions with each client. A copy of the socket of each session, together with descriptor information of the file requested are transferred to a download manager, and the original connection immediately closed. The connection to the client remains open via the copy of the socket, which is then converted to a non-blocking socket by the download manager converts to copy of the socket to a non-blocking socket, and downloads the requested information to the client using the non-blocking socket and its own connection to the server. The arrangement is capable of dealing with loads that would ordinarily overwhelm the server's capability of establishing and maintaining individual TCP sessions with its clients. Heavy loads, including bursty peak loads, are handled gracefully, without causing the server to stall, or to refuse connections.

Abstract: A network server in accordance with the present invention comprises shared memory and a cache mechanism for caching intermediate code files in said shared memory. The invention is particularly useful for Internet Web servers and for use with caching the intermediate code generated by scripts run by PHP scripting engines.