Abstract: A computer-implemented method includes providing a fixed portion of a data model, uploading external files to an extended portion of the data model, matching at least some parts of the external files to the fixed portions of the data model, and using data from both the fixed and extended portions of the data model together. A computer-implemented method includes receiving a query from a user to a data model that includes a stored subject area portion and a stored extended subject area portion, accessing at least one storage to retrieve the subject area portion and the extended subject area portion, joining relevant portions of the subject area and extended subject area, extracting answers to the query from the joined portions, and reporting the answers to the user.

Abstract: Embodiments disclose a system that allows for improved generation of web requests for scraping that, because of the nature of the requests and time and manner they are sent out, appear more organic, as in human generated, than conventional automated scraping systems. The system then manages how a client request to scrape a target website is made to the site, masking the request in a manner that makes it appear to the Web server as if the request is not generated by an automated system. In this way, by appearing more organic, Web servers may be less likely to block requests from the disclosed system or may take longer to block requests from the disclosed system. By avoiding Web servers blocking requests and extending the lifetime of IP proxies before they are blocked, embodiments can use a limited IP proxy address space more efficiently.

Abstract: The present invention relates to methods and systems for storing and querying database entries with neuromorphic computers. The system is comprised of a plurality of encoding subsystems that convert database entries and search keys into vector representations, a plurality of associative memory subsystems that match vector representations of search keys to vector representations of database entries using spike-based comparison operations, a plurality of binding subsystems that update retrieved vector representations during the execution of hierarchical queries, a plurality of unbinding subsystems that extract information from retrieved vector representations, a plurality of cleanup subsystems that remove noise from these retrieved representations, and one or more input search key representations that propagates spiking activity through the associative memory, binding, unbinding, cleanup, and readout subsystems to retrieve database entries matching the search key.

Abstract: A request is received, from a mutator thread, to load a first reference to a first object from a heap memory onto a call stack of the application thread. Responsive to receiving the request, a system retrieves the first reference from the heap memory. The system executes a bitwise shift operation that (a) removes one or more bits representing the first garbage collection state and (b) generates a second reference from the first reference. Based on a particular bit, of the one or more bits removed from the first reference by the shift operation, the system determines whether to perform a set of garbage collection operations on the first reference to bring the first reference to a good state. The second reference, without any indication of any of the plurality of garbage collection states, is stored to the call stack.

Abstract: System and methods are provided for performing table navigation operations on a display, wherein the table comprises rows and columns and at least one cell that contains more information than presented on the display. Disclosed embodiments include receiving a scroll signal for scrolling the table, wherein the scroll signal results from a motion of a user on the display; in response to a vertical component in the motion, causing the table to scroll vertically; in response to a horizontal component in the motion, causing the table to scroll horizontally; receiving an enhancing scroll signal resulting from an enhancing motion for revealing hidden information within the at least one cell on the table; and in response to the enhancing scroll signal, revealing at least a portion of the hidden information within the at least one cell.

Abstract: Embodiments disclose a system that allows for improved generation of web requests for scraping that, because of the nature of the requests and time and manner they are sent out, appear more organic, as in human generated, than conventional automated scraping systems. The system then manages how a client request to scrape a target website is made to the site, masking the request in a manner that makes it appear to the Web server as if the request is not generated by an automated system. In this way, by appearing more organic, Web servers may be less likely to block requests from the disclosed system or may take longer to block requests from the disclosed system. By avoiding Web servers blocking requests and extending the lifetime of IP proxies before they are blocked, embodiments can use a limited IP proxy address space more efficiently.

Abstract: With respect to a search method, for execution by a computer, for searching for multidimensional data that satisfies a search condition in a table representing a multidimensional data set including a plurality of search target parameters, the search method includes creating multidimensional indexes including a plurality of transposition blocks for identifying record numbers based on values of parameters of the plurality of search target parameters by using the multidimensional data set included in the table, and identifying a target record number of the multidimensional data that satisfies the search condition in the multidimensional data set included in the table by using the multidimensional indexes.

Abstract: A data replication method includes obtaining differential data information corresponding to differential data, where the differential data information includes a storage address of the differential data, and a determining value of the differential data, replicating the differential data from the primary volume to the secondary volume according to the storage address of the differential data that is located in the primary volume when the determining value is not less than a preset threshold, and taking a snapshot for the primary volume when the determining value is less than the preset threshold and replicating the differential data to the secondary volume.

Abstract: During execution of garbage collection marking, an application thread receives a first request to overwrite a reference field of an object, the object comprising at least a first reference and the first request comprising a second reference to be written to the reference field. Responsive to receiving the first request, the application thread determines a marking parity for objects being traversed by the garbage collection marking process and loads the first reference from the heap. The application thread determines that marking metadata of the first reference does not match the marking parity. Responsive to that determination, the application thread adds the first reference to a marking list, modifies the second reference to include the current marking parity as the marking metadata, and stores the modified second reference to the first reference field. In subsequent writes to the reference field, the application thread refrains from adding to the marking list.

Abstract: An exemplary embodiment of the present disclosure discloses a computer program stored a non-transitory computer readable storage medium. When the computer program is executed by one or more processors, the computer program performs operations for Change Data Capture (CDC) by one or more processors, and the operations include: extracting a change data from at least one redo log of an online redo log and an archive redo log; analyzing at least one information of a resource utilization rate information and a remain log information of a source database server; and determining to process the change data in one mode of a first mode saving the change data as a CDC file and a second mode recording the change data in a memory, based on at least one of the remain log information and the resource utilization rate information.

Abstract: A platform identifies that a first venue attendee is similar to a second venue attendee based on at least one shared trait. The platform identifies an indicator of positivity about a particular point of interest corresponding to the second venue attendee. The platform selects the particular point of interest as a recommended point of interest for the first venue attendee based on the similarity between the first venue attendee and the second venue attendee and the indicator of positivity about the particular point of interest corresponding to the second venue attendee.

Abstract: Disclosed are a method and apparatus for limiting the number of results returned by a data store in response to a query. Upon receiving an initial query, the data store returns a page of results that includes a subset of the data items within the data store satisfying the conditions of the query. The data store also provides a marker indicating the extent of the set of data items. If a subsequent query that requests additional results which satisfy the same query conditions and that includes the marker is received, the data store returns a page of results that includes a subset of data items that are disjoint from the initial subset, and provides an updated marker which indicates the extent of the union of the initial and subsequent subsets. If still further results are desired from the data store, an additional query containing the updated marker may be submitted.

Abstract: Disclosed herein are system, method, and computer program product embodiments for maintaining of a geometric object in a database. An embodiment operates by a database maintaining a first page storing a data block in the database's on-disk store such that the data block stores at least one byte of the geometric object. After receiving the request for the geometric object, the database loads the page storing the geometric object in the in-memory store and determines the size of the geometric object. Based on the size of the geometric object, the database stores the geometric object in the in-memory store directly or in a heap of the in-memory store.

Abstract: A secondary location is configured as a recovery service for a primary location of the service. The secondary location is maintained in a warm state that is configured to replace the primary location in a case of a failover. During normal operation, the secondary location is automatically updated to reflect a current state of the primary location that is actively servicing user load. Content changes to the primary location are automatically reflected to the secondary location. System changes applied to the primary location are automatically applied to the secondary location. For example, removing/adding machines, updating machine/role assignments, removing adding/database are automatically applied to the secondary location such that the secondary location substantially mirrors the primary location. After a failover to the secondary location, the secondary location becomes the primary location and begins to actively service the user load.

Abstract: The present invention relates to execution optimization of database queries. Herein are techniques for optimal execution based on query interpretation by translation to a domain specific language (DSL), with optimizations such as partial evaluation, abstract syntax tree (AST) rewriting, just in time (JIT) compilation, dynamic profiling, speculative logic, and Futamura projection. In an embodiment, a database management system (DBMS) that is hosted on a computer generates a query tree that represents a database query that contains an expression that is represented by a subtree of the query tree. The DBMS generates a sequence of DSL instructions that represents the subtree. The sequence of DSL instructions is executed to evaluate the expression during execution of the database query. In an embodiment, an AST is generated from the sequence of DSL instructions. In an embodiment, the DSL AST is optimally rewritten based on a runtime feedback loop that includes dynamic profiling information.

Abstract: Techniques are described herein for determining an information gain score for one or more documents of interest to the user and present information from the documents based on the information gain score. An information gain score for a given document is indicative of additional information that is included in the document beyond information contained in documents that were previously viewed by the user. In some implementations, the information gain score may be determined for one or more documents by applying data from the documents across a machine learning model to generate an information gain score. Based on the information gain scores of a set of documents, the documents can be provided to the user in a manner that reflects the likely information gain that can be attained by the user if the user were to view the documents.

Abstract: A computer-implemented method is disclosed. The method includes receiving from a remote device a search query, generating a plurality of different category-directed result sets for the search query, determining an order for the plurality of category-directed result sets based on the search query, and transmitting the plurality of category-directed result sets to the remote device, in a manner that the result sets are to be displayed in the remote device in the determined order.

Abstract: One embodiment sets forth a technique for generating a tree structure within a computer memory for storing sparse data. The technique includes dividing a matrix into a first plurality of equally sized regions. The technique also includes dividing at least one region in the first plurality of regions into a second plurality of regions, where the second plurality of regions includes a first region and one or more second regions that have a substantially equal number of nonzero matrix values and are formed within the first region. The technique further includes creating the tree structure within the computer memory by generating a first plurality of nodes representing the first plurality of regions, generating a second plurality of nodes representing the second plurality of regions, and grouping, under a first node representing the first region, one or more second nodes representing the one or more second regions.

Abstract: A method for accessing a file in a storage system is provided. The method includes determining, for each file chunk of the file, an authority among differing storage nodes of the storage system and receiving from the authority having ownership of the file chunk, location information for the file chunk. The method includes accessing file chunks of the file as directed by each of the determined authorities.

Abstract: A method and a device are for exchanging information regarding the clinical implications genomic variations. In an embodiment, the method includes receiving login-data of a user; evaluating the login-data received; establishing an encrypted data connection to the user after the evaluating indicates a positive evaluation of the login-data; saving, upon receiving a dataset in a context of a genomic variation, the dataset received in a memory, context-related with the genomic variation; and evaluating, upon a user request being received and connected with a search query for the genomic variation, a set of datasets from the memory, the datasets being context-related with the genomic variation and the set including the datasets that the user is authorized to receive, and sending the set of datasets to the user.