Introduced here are various embodiments for selectively assigning a query to an expert. A network-accessible server system may receive a query from a client device indicating a question or project proposal. The query text may be parsed and attributes of the query may be determined by inspecting the parsed query text. The query attributes may be compared with attributes associated with a pool of experts with various specialties and expertise in various fields. The network-accessible server system may match the query attributes with attributes associated with a first expert with a similarity that exceeds a threshold similarity level to identify that an expertise of the first expert matches the requested expertise in the query. The first expert may be assigned to the query and prompted to provide a response to the query.

A packet processing technique can include receiving a packet, and parsing the packet based on a protocol field to generate a parse result vector. The parse result vector is used to select between forwarding the packet to a virtual machine executing on a host processing integrated circuit, forwarding the packet to a physical media access controller, multicasting the packet to multiple virtual machines executing on the host processing integrated circuit, and sending the packet to a hypervisor.

Disclosed herein is a search method performed by a server, including: receiving a user question from a user terminal; generating a user question vector for the user question; selecting similar question candidates based on a similarity to the user question vector; generating an answer to the user question based on the similar question candidates; and transmitting the answer to the user question to the user terminal.

A search query relating to a search for people and including one or more search terms is received. A search graph for the search is created from a previously created graph which is a directional graph in which people are represented by nodes and content is represented by nodes or edges. The search graph is generated by filtering out nodes or edges that represent content that is determined not to be relevant to the search terms in the search query; and, for the remaining content that is determined to be relevant to the search terms in the search query, adding to the graph a measure of the relevance of the content to the search terms. The search results are generated by operating on the search graph to identify people in the search graph who are sources of content that is relevant to the search terms.

Technologies are described herein for executing queries expressed with reference to a structured query language against unstructured data. A user issues a structured query through a traditional structured data management (“SDM”) application. Upon receiving the structured query, an SDM driver analyzes the structured query and extracts a data structure from the unstructured data, if necessary. The structured query is then converted to an unstructured query based on the extracted data structure. The converted unstructured query may then be executed against the unstructured data. Results from the query are reorganized into structured data utilizing the extracted data structure and are then presented to the user through the SDM application.

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.

The present teaching relates to a method, system and programming for operating a data storage. The data storage comprises of different portions including: a first portion having a plurality of metadata objects stored therein, each of the metadata objects being associated with a filter and corresponding to a range of keys, wherein at least one of the metadata objects is associated with a data structure, and a second portion having a plurality of files stored therein, each of the plurality of files being associated with one of the plurality of metadata objects; The data storage synchronizes a scan request with respect to one or more write requests based on a parameter associated with the scan request and each of the one or more write requests.

The disclosed embodiments provide a system for processing queries of a graph database storing a graph, wherein the graph comprises a set of edges defined by a first linkage, a second linkage, and a third linkage. During operation, the system maintains the base version of an index of the graph database. Upon branching a version of the graph database from a first offset representing a virtual time in the base version of the graph database, the system creates a branched version of the index from a second offset corresponding to the virtual time in the base version of the index. The system then processes queries of the graph database based on the offsets and references from the branched version of the index to the base version of the index.

The disclosed embodiments provide a system for processing queries of a graph database storing a graph, wherein the graph comprises a set of edges defined by a first linkage, a second linkage, and a third linkage. During operation, the system maintains the base version of an index of the graph database. Upon branching a version of the graph database from a first offset representing a virtual time in the base version of the graph database, the system creates a branched version of the index from a second offset corresponding to the virtual time in the base version of the index. The system then processes queries of the graph database based on the offsets and references from the branched version of the index to the base version of the index.

Techniques are described herein for providing search features within a carousel. A request may be received to display a network page (e.g., a user profile page). The carousel may present a subset of items of a set of items (e.g., items associated with the user profile). User input indicating a scrolling action within the carousel can be received. In response, a user interface (UI) element associated with conducting a search may be presented in an expanded form overlaid atop the carousel. After a predefined period of time has elapsed, the UI element may transition to a collapsed form. If the UI element is selected, the user may be navigated to the end of the carousel where a statically-positioned presentation of the UI element is presented. A search may be conducted from the statically-positioned presentation. The search may be performed against the set of items associated with the user profile.