Abstract: A location associated with a user of a computing device and a prefix portion of an input string may be received as one or more successive characters of the input string are provided by the user via the computing device. A list of suggested items may be obtained based on a function of respective recommendation indicators and proximities of the items to the location in response to receiving the prefix portion, and based on partially traversing a character string search structure having a plurality of non-terminal nodes augmented with bound indicators associated with spatial regions. The list of suggested items and descriptive information associated with each suggested item may be returned to the user, in response to receiving the prefix portion, for rendering an image illustrating indicators associated with the list in a manner relative to the location, as the user provides each successive character of the input string.

Abstract: A method for contextual data visualization includes receiving data selected by a user and meta-data associated with the data. The data is analyzed, using a processor of a computing device, to determine content and structure attributes of the data that are relevant to visualization of the data. The meta-data is analyzed, using a processor of the computing device, to determine a context in which the visualization of the data will be used. A database comprising an aggregation of visualization records from a plurality of users is accessed and at least one template from the data visualization records that matches the data attributes and context is selected. A data visualization is created by applying at least one template to the data.

Abstract: A method for providing a subscribed service includes: receiving a service request at a service; accessing, at a subscriber data abstraction layer interposed between the service and the subscribed database, subscriber data from a subscriber database; and processing the service request using the accessed subscriber data.

Abstract: Techniques are presented for rule-based selection of alternate data sources for multidimensional data statements. A virtual multidimensional data model is implemented to represent datasets that are accessed at various data sources. Derivative cubes generated from the virtual multidimensional data model are structured to have a respective data source metadata layer that is populated at data statement execution time to identify a target data source. Data source selection rules are established to map the attributes of data statements to target data sources. The data source selection rules are evaluated subject to data statement attributes derived from detected data statements to dynamically select target data sources for the data statements. The derivative cubes codify, in their respective data source metadata layers, a unique set of data source attributes identifying the target data sources. The derivative cubes are accessed to facilitate execution of the data statements on datasets at the target data sources.

Abstract: Examples disclosed herein relate to accessing electronic databases. Some examples disclosed herein may include partitioning a computation task into subtasks. A processing node of a computation engine may generate a database query for retrieving an electronic data segment associated with at least one of the subtasks from a database. The database query may include pre-processing instructions for a database management system (DBMS) associated with the database to pre-process the electronic data segment before providing the electronic data segment to the processing node. The pre-processing instructions may include at least one of: filtering, projection, join, aggregation, count, and user-defined instructions. The generated query may be provided to the DBMS.

Abstract: Storing an incoming data stream using successive files that are consecutively populated. The appropriate file to populate a given data stream portion into is determined by mapping the data stream offset to a file, and potentially also an address within that file. The successive files may be the same size, so that the file can be identified based on the data stream address (or offset) without the use of an index. Furthermore, the files may be easily named by having that size be some multiple of a binary power of bytes. That way, the files themselves can be automatically and named and identified by using the more significant bit or bits of the data stream offset to uniquely identify the file and establish ordering of the files. Replication may occur from a primary to a secondary store by transmitting the offset, and the actual data to be stored.

Abstract: A storage system includes processing circuitry configured to detect a file operation in a folder of a first storage, sequentially register information of files having undergone a change as a file replication processing target in a database, execute file replication processing to sequentially replicate each individual file of the files registered as the file replication processing target to a second storage, execute folder replication processing to replicate the folder to the second storage, in the folder replication processing, exclude a file belonging to the folder for the folder replication processing from the file replication processing target, and execute the file replication processing in parallel with the folder replication processing when the information of the file having undergone a change has been registered as the file replication processing target in the database during the folder replication processing.

Abstract: Related post identification and presentation is described. A system includes an interface to receive a base post generated by an author. An analyzer analyzes the base post and a number of other posts. A search engine of the system identifies from the number of other posts and based on the analysis, a number of related posts that relate to the base post. A posting engine of the system presents the base post along with identified related posts in an activity stream of a subscriber.

Abstract: A first snapshot of a primary disk of a virtual machine (VM) is requested at a beginning of a current backup cycle. A first indication that the first snapshot has been created includes a first listing of changed blocks since a last snapshot was requested. The first snapshot is deleted. Blocks listed in the first listing are copied while the first snapshot is absent. After the copying, a second snapshot is requested. A second indication that the second snapshot has been created includes a second listing of changed blocks since the first snapshot. Blocks listed in both the first and second listings are copied while the second snapshot is present.

Abstract: Updating a database is provided. The updating is noticeable by all read and/or write processes. In response to a write request to the database, a temporary copy of the database is generated. The write operations are performed to the temporary copy of the database. The current database generation of the database is replaced with the temporary copy for creating a next database generation.

Abstract: A method is used in managing online help information in a data center. The method gathers a plurality of help information associated with a plurality of components operating in the data center. The method creates an integrated repository of online help information by indexing contents of the plurality of help information into an indexed data structure of a plurality of search expressions. Each search expression is associated with a set of online help documents. The integrated repository is accessible by each component. In response to a search query for an online help document, the method provides at least one help document relevant to the search query by searching the indexed data structure.

Abstract: A computer system hosting a column-store database engine is responsive to database requests for the update and retrieval of data from within a stable data table and providing for the storage of database tuples within a column-store organized database structure. A positional delta tree data structure is implemented in the memory space of the database engine and is operatively coupled in an update data transfer path between a database engine interface and the stable data table. The positional delta tree data structure includes a differential data storage layer operative to store differential update data values in positionally defined relative reference to database tuples stored by the stable data table.

Abstract: Metadata elements are created and validated. Once the metadata element is validated it is applied to raw incoming data. If a match is obtained, then the raw data is sent to a designated storage structure. When there is no match, then the raw data is sent to a data structure designated for unorganized raw data.

Abstract: A system, method, and computer-readable medium for performing a variable and interaction detection operation. In certain embodiments, the variable and interaction detection operation detects important variables and as well as interactions among certain important variables in big data. In certain embodiments, the variable and interaction detection operation includes a robust automated process flow (i.e., an analytic recipe) which identifies important variables and their interactions in large data sets.

Abstract: A method of modifying a database architecture to improve database performance is disclosed. A replication database table is generated from an original database table. The original database table is divided into a first plurality of partitions optimized for handling accesses for satisfying a first type of query. The replication database table is divided into a second plurality of partitions optimized for handling accesses for satisfying a second type of database query. Based on receiving the database query of the first type, the query of the first type is routed to one host of a plurality of hosts to satisfy the query, the one host hosting one of the first plurality of partitions; based on receiving the database query of the second type, the query is routed to the same or another host of the plurality of hosts to satisfy the query, the second host hosting one of the second plurality of partitions.

Abstract: The embodiments described in this disclosure comprise improved systems, methods and computer readable media for preconfiguring measures and dimensions in a database analytics application. In one embodiment, the solution described herein can be configured to activate only a subset of the measures from a catalog of measures supported by the database analytics application based on the data the user currently has stored in their database systems. Certain embodiments may be configured to determine (1) when a measure is selectable (i.e., activated) by users based on relevant base information contained in the user data, and (2) when to automatically activate inputs to a measure that has been previously selected.

Abstract: Generally discussed herein are devices, systems, and methods for database management. A method may include determining a first hyperloglog (HLL) sketch of a first column of data, determining a second HLL sketch of a second column of data, estimating an inclusion coefficient based on the first and second HLL sketches, and performing operations on the first column of data or the second column of data in response to determining the inclusion coefficient is greater than, or equal to, a specified threshold.

Abstract: In an implementation, providing service information is described. Current scenario information of a client device is obtained by a server and from a client device. Service information matching the current scenario information of the client device is obtained by the server, where the service information is associated with a plurality of services. The service information is returned by the server and to the client device, where the client device displays the service information in a specified interface using a visualization template, and where the service information includes at least one of access information or an interface of an application.

Abstract: Geotag data embedded in a photograph is converted to a multilevel hierarchical place name tag, which is a new data structure. Higher hierarchy levels correspond to larger geographical regions. Lower hierarchy levels correspond to smaller geographical regions. The geotag data is used to locate the photograph on a map. A cluster of nearby photographs is defined and represented by a consolidated pin. The identification and quantity of clustered photographs depends on the relative locations of the photographs and the map zoom level. A consolidated pin label is defined based on which hierarchy levels, if any, have a common place name tags. In some cases the consolidated pin label includes only place name tags that are shared amongst all clustered photographs. In other cases the consolidated pin label includes a short list of mutually exclusive place name tags. The consolidated pin label is displayed on the map near the consolidated pin.

Abstract: Embodiments disclosed herein generally relate to a method for searching a database. The application receives an input identifying one or more users. The application matches the input to one or more user accounts, each user account corresponding to a user that was identified. The application presents to a requestor public accounts of each identified user account. The application receives a keyword input that filters one or more files in the public accounts. The application receives an input that saves a search comprising the user accounts and the keyword input. The application queries the database using the search. The application presents to the requestor a list of all files found using the search. The application dynamically updates the list to include new files matching a criteria of the search as new files satisfying the search are uploaded to the database.