Abstract: Disclosed are a method and a system for transmitting a file folder from the sending end to the receiving end. The system uses a file folder transmission unit at the sending end side to generate a directory structure file of the file folder. The directory structure file may have properties such as the size of the file folder, paths and path lengths of the files in the file folder. The sending end then sends the directory structure file to the receiving end through the file folder transmission unit to allow the system to determine which files in the file folder need to be transmitted. The needed files in the file folder are then transmitted to the receiving end according to the determination. The sending end and the receiving end may communicate using an instant messaging tool. The disclosed method and system allow a faster and more convenient file folder network transmission.

Abstract: A system for replicating a filesystem running on multiple nodes comprising an originator system and a replica system. The originator system includes a plurality of nodes. The replica system includes a plurality of nodes and a processor. The plurality of nodes of the replica system are paired with the plurality of nodes of the originator system. The processor is configured to receive an indicator of a node of the plurality of nodes of the replica system finishing replication for a view of a filesystem at a point in time. The processor is further configured to indicate that replication for the view of the filesystem is complete in the event that all replica system nodes have received their indication for the view.

Abstract: A method in a data processing system and apparatus for organizing files or web pages, structured or unstructured, of multiple users stored across one or more server computers into hierarchical file structures on a recordable medium of a data processing system. A user-defined metalabel is assigned to each of the electronic files or web pages. The electronic files or web pages are organized as a function of the metalabels into the hierarchical file structures.

Abstract: A system, method, and computer program for creating an index structure for spatial data, comprising representing a product structure by a network of nodes and edges; setting a local geometric bound for each of said network nodes; propagating a cumulative geometric bound of said local geometric bounds along each of said network edges; and simplifying said cumulative geometric bound at each of said network node during said propagation; whereby a geometric bound of each network node forms a spatial index geometric bound for a matching data model object and appropriate means and computer-readable instructions.

Abstract: A development environment makes it easier to develop and use location aware software applications. Combining the currently separate and complex tasks of location information gathering, analysis, and display and making them integrated such that non-experts can build location services into their applications increases a developer's capability to write rich location-aware software applications. A higher level programming model allows a programmer to use location information as a logical entity rather than just raw location data, such as latitude and longitude. A location data store and map data store may be accessed by different location aware applications on the device. Instead of each location application relying on its own data store, applications may share their location related information.

Abstract: Provided are a method and apparatus of filtering geographical data. The method may include selecting a map region to be retrieved, receiving a retrieval object and a retrieval condition, outputting a trapezoidal interface, verifying a threshold corresponding to a height of the trapezoidal interface for each position of the map region, filtering the retrieval object satisfying the threshold or more or less in each position of the map region to extract the filtered object, and displaying the filtered object on the map region to output the displayed object.

Abstract: Systems, methods, and media for providing a digital photo archive are provided. In some embodiments, systems for providing a digital photo archive are provided, the systems comprising: at least one hardware processor that: collects a plurality of photos from a plurality of sources; collects a plurality of pieces of information from the plurality of sources; determines whether one of the plurality of photos is presently stored in the archive; stores the one of the plurality of photos in the archive only if the one of the plurality of photos has been determined to not be presently stored in the archive; and indicates to a user that the one of the plurality of photos is a duplicate photo if it is determined that the one of the plurality of photos has been determined to be presently stored in the archive.

Abstract: A crowdsourced search and locate platform, comprising an application server and a client interface application. The application server: receives connections from crowdsourcing participants; navigates a first crowdsourcing participant to a specific geospatial location; sends an image corresponding to the geospatial location to the first crowdsourcing participant; receives tagging data from the first crowdsourcing participant, the tagging data corresponding to a plurality of objects and locations identified by the first crowdsourcing participant. The client interface application: displays elements enabling an administrative user to configure a crowdsourced search and locate campaign; displays other elements enabling an administrative user to configure and run a crowdrank algorithm; and upon the user's selecting a particular object type icon, displays tags of the type selected by placing visual indicators at each tagged location of objects of the selected type within the plurality of image strips.

Abstract: Assisted face selection is disclosed. According to some implementations, a method can include obtaining contact information associated with a contact and displaying on an interface of a computing device an image (e.g., a thumbnail image) representative of the contact. The method can include receiving an indication to change the contact-representative image, determining that one or more other images from a plurality of other images correspond to the contact based on the contact information, and displaying the one or more other images. The method can include receiving a selection of one of the one or more other images and displaying on the interface the selected image as the contact-representative image. Receiving the indication can include receiving a selection of the displayed contact-representative image. Automatic selection of images is also disclosed.

Abstract: In general, the subject matter described in this specification can be embodied in methods, systems, and program products for loading media files to a mobile computing device. A media library that includes media files is stored at a server system. Information indicating a present state of the mobile device is accessed, where the present state is based on the device being at a geographical location at a present time. Information indicating a previous state of the mobile device is accessed, where the previous state is based on the device being at a previous geographical location at a previous time. A selection of preferred media files are accessed based on the present state and the previous state. A selection of a subset of media files are accessed based on the preferred media files. At least a portion of each media file in the subset is transmitted to the mobile device.

Abstract: A method includes identifying a table over a conventional database used by an application, creating a view of the table equivalent to the identified table in an in-memory database, and calling the view with a same call as used for the identified table such that calling the view via the application provides a same result as would have been obtained from the same call to the table in the conventional database.

Abstract: According to one embodiment of the present invention, a system decomposes a set of schema files. The system receives a set of schema files and automatically identifies a plurality of root schema files in the set, where a root schema file is determined based on remaining schema files in the set lacking a reference to that schema file. For each root schema file, the system creates a subset of the original set of schema files. The subset contains the root schema file, and at least one subset further includes one or more schema files that provide information for that root schema file. Embodiments of the present invention further include a method and computer program product for decomposing a set of schema files in substantially the same manners described above.

Abstract: In one of many possible implementations, an exemplary system includes a plurality of data subsystems configured to store local data associated with an external party, the data subsystems configured to be maintained by an internal party. The system further includes a data integration subsystem configured to store global data and a defined mapping of the global data to the local data, the global data including a global data record mapped to a local data record having a first data schema type, recognize a migration event in the local data, the migration event including migration of the first schema type local data record to a second schema type local data record, and associate a smart mapping record with the global data record, the smart mapping record configured to selectively map the global data record to one of the first schema type local data record and the second schema type local data record.

Abstract: Methods and apparatus for configurable-capacity time-series tables are disclosed. A schedule of database table management operations, including at least an operation to change a throughput constraint associated with a table in response to a triggering event, is generated. The table is instantiated with an initial throughput constraint in accordance with the schedule. Work requests directed to the table are accepted based on the initial throughput constraint. The throughput constraint is modified in response to the triggering event. Subsequent work requests are accepted based on the modified throughput constraint.

Abstract: Aspects provide a method of determining a storage location for a data item, including providing first and second data storage locations, the first location having an appreciably faster access speed than the second, the data storage locations are primary storage locations providing persistent storage, accessing a score associated with the data item, the score being calculated based on a frequency of access; and selecting only one of the storage locations based on the score with respect to other data scores, wherein the data item is stored in only one of the storage locations at any time, re-calculating the scores, wherein the score is accessed from a score table of data items; and in response to re-calculating of the scores, causing a change in the selection of the data storage location, removing the data item from a current storage location and adding the data item to a newly selected storage location.

Abstract: Methods and apparatuses are provided for storing graph data within a column-oriented data store. Graph data including vertex data describing one or more vertices in the graph and edge data describing one or more edges within the graph may be received. One or more vertex rows within the column-oriented data store may be assigned, whereby each vertex row of the one or more vertex rows is assigned to one vertex of the one or more vertices. One or more edge rows within the column-oriented data store may also be assigned, whereby each edge row of the one or more edge rows is assigned to one edge of the one or more edges. At least one vertex row and at least one edge row may be populated based on the graph data.

Abstract: Event data comprising an unordered string set may be received. String set dictionary indexes may be assigned for strings of the unordered string set in a string set dictionary. The unordered string set may be sorted to provide a sorted series based on the string set dictionary indexes for the unordered string set. A differential series may be computed from the sorted series. The differential series may be encoded into binary code words. In an embodiment, the event data also may comprise strings. A schema version associated with the strings in a row may be determined. Computing resources may be allocated based on the schema version.

Abstract: A database query of point data among two or more axes of a database is received. The database stores point data in distinct integer vectors with a shared dictionary. Thereafter, the dictionary is scanned to determine boundaries for each axis specified by the query. In response, results characterizing data responsive to the query within the determined boundaries for each axis are returned. Related apparatus, systems, techniques and articles are also described.

Abstract: A system, method, and apparatus are provided for supporting and/or executing count-distinct queries. A large set of data (e.g., tens or hundreds of millions of event records) is condensed daily to generate presence bitmaps to reflect the distinctiveness of a selected data dimension S (e.g., user ID) for one or more key dimensions g1, g2, . . . (e.g., advertisement ID, campaign ID, advertiser ID). The condensation process eliminates duplication and yields a single value (e.g., 1 or 0) for each tuple [S, g1, . . . ] to represent the distinctiveness of each value in the S dimension to each combination of values in the grouping dimensions. On a monthly basis, the daily values are condensed to yield a single value for the month, and a similar process is applied on any other desired time granularities (e.g., year). The condensed data may be generated for any combination of selected dimension(s) and grouping dimension(s).

Abstract: A system, method, and apparatus are provided for supporting and/or executing count-distinct queries. A large set of data (e.g., tens or hundreds of millions of event records) is condensed daily to generate presence bitmaps to reflect the distinctiveness of a selected data dimension S (e.g., user ID) for one or more key dimensions g1, g2, . . . (e.g., advertisement ID, campaign ID, advertiser ID). The condensation process eliminates duplication and yields a single value (e.g., 1 or 0) for each tuple [S, g1, . . . ] to represent the distinctiveness of each value in the S dimension to each combination of values in the grouping dimensions. On a monthly basis, the daily values are condensed to yield a single value for the month, and a similar process is applied on any other desired time granularities (e.g., year). The condensed data may be generated for any combination of selected dimension(s) and grouping dimension(s).

Abstract: Techniques are provided for maintaining data persistently in one format, but making that data available to a database server in more than one format. For example, one of the formats in which the data is made available for query processing is based on the on-disk format, while another of the formats in which the data is made available for query processing is independent of the on-disk format. Data that is in the format that is independent of the disk format may be maintained exclusively in volatile memory to reduce the overhead associated with keeping the data in sync with the on-disk format copies of the data.

Abstract: This disclosure relates to a method, article of manufacture, and apparatus for backing up data. In some embodiments, this includes a backup server locating one or more instances of data associated with a list of identifiers, wherein each instance of data comprises one or more target volumes and associated journal volume; the enablement of replication; and replication.

Abstract: Methods, devices, and computer-readable storage media for tracking changes in a database including at least one database table include adding a first column to a schema of each database table. The first column includes a row update identifier for each row of the database table. A global update identifier is incremented in response to a row change and recorded as the row update identifier for the changed row. In response to a latest database synchronization event, a reference table including a synchronization update identifier is generated, and the global update identifier is incremented and recorded as the synchronization update identifier. An update to a row in a database table is tracked based at least upon determining that a row update identifier of the updated row in the database table is greater than the synchronization update identifier in the reference table.

Abstract: A system and method to dynamically update a data field are disclosed. In some embodiments, data may be received from a plurality of databases and organized into a plurality of data fields. A first data field may be associated with a single database of the plurality of databases. A user may modify the first data field and the system and method may identify a dependency between the first data field and at least a second data field. The second data field may be updated based on the dependency between the first data field and the second data field.

Abstract: An IMS DEDB database restructure operation creates an empty offline DEDB having the desired structure. The offline database is populated with data from a source (online) database while keeping the source database online (i.e., available for access and update operations). Updates to the source database made during this process are selectively processed in parallel with the offline DEDB load operation. When the contents of the offline database is substantially the same as the source or online database, the source database is taken offline, final updates to the offline database are applied whereafter the offline database is brought online, thereby replacing the source database. It is significant to note that updates occurring to the source or online DEDB are applied to the offline DEDB.

Abstract: Disclosed are systems, methods, and computer-readable storage media for enhancing event summaries of synced online content management system interactions. Users can identify one or more of the collapsed events markers that have pointers to the original, uncondensed, event markers. Upon identifying the one or more collapsed event markers, users can add additional data, via the pointers, to the original, uncondensed, event markers that were used to generate the collapsed event marker. The content management system can then perform a new analysis of the shared dataspace, analyzing the event markers using pre-existing data and the newly added data to create additional collapsed event markers, modify previously generated collapsed event markers, or remove/replace collapsed event markers. These enriched collapsed event markers can then newly presented to the user.

Abstract: An embodiment for method for identifying and selecting events and routing them into the marketing mix, creating event marketing and marketing portfolios. In the method, events may be extracted from a database of events. The extracted events may then be passed through one or more manual or automatic data filters to identify one or more events that correspond to a predetermined goal of an enterprise (e.g., increase sales, increased product recognition, etc). Information concerning the corresponding events may then be provided in the form of a report.

Abstract: The subject disclosure is directed towards enriching database query responses using data from external data sources. When processing a database query seeking enriched data from an external data source, a request is communicated to the external data source based on the database query. An enriched database query response is generated based on data provided by the external data source. The enriched database query response may be combined with data returned via an internal database query operation, and/or inserted into a local database table.

Abstract: Embodiments include generating data models that may give semantic meaning for unstructured or structured data that may include data generated and/or received by search engines, including a time series engine. A method includes generating a data model for data stored in a repository. Generating the data model includes generating an initial query string, executing the initial query string on the data, generating an initial result set based on the initial query string being executed on the data, determining one or more candidate fields from one or results of the initial result set, generating a candidate data model based on the one or more candidate fields, iteratively modifying the candidate data model until the candidate data model models the data, and using the candidate data model as the data model.

Abstract: A system and method for providing social-network (Centralized Community Search database)—provided outputs to a mobile-electronic-device user in response to the user's spoken request, comprising: a data input port configured to receive speech information from the mobile-electronic-device user; a memory configured to store a transcript of the spoken request and metadata associated with the spoken request comprising at least a location associated with the user during the spoken request; an interface port to a social network database, configured to transmit a request to mine information of the social network database based on the transcript and the metadata, and to receive social network information from the social network database based on the transmitted request.

Abstract: A search system includes a non-transitory computer-readable storage device, and a computing device. A term extracting unit causes the computing device to extract multiple terms from an input query, a weight computing unit causes the computing device to compute a weight for each of the multiple terms, and a reduction query recommending unit causes the computing device to remove at least one term from the multiple terms, based on the weight, and to provide at least one reduced query using remaining terms. A search method that uses a computing device to provide a reduced query, the method includes extracting multiple terms from an input query; computing, by the computing device, a weight of each of the multiple terms; and removing at least one term from the multiple terms, based on the weight, and providing at least one reduced query generated using remaining terms out of the multiple terms.

Abstract: In accordance with certain embodiments, a query from a client may be received at a server, and a default query range may be applied to the query. The query may be executed in a first execution using an index comprising a category of information stored in the database and subject to the default query range. If the number of query results from the first execution is outside a predetermined range, then the query range may be adjusted to obtain a number of query results closer to or within the predetermined range. Additionally, the query may be executed in a second execution using the index comprising the category of information stored in the database and subject to the adjusted query range. Thereafter, the query results obtained from the second execution of the query may be sent to the client.

Abstract: Computer-implemented and associated operating methods evaluate robustness of a query plan by measuring performance with regard to a range of runtime conditions and producing a map of relative performance of the given query plan when compared with alternative plans for a range of conditions. The computer-implemented system comprises logic that evaluates the selected query plan in comparison to multiple alternative query plans in a predetermined range of runtime conditions that include data characteristics. The logic produces a set of performance measurements and analyzes the measured performance to map performance of the selected query plan in comparison to performance of one or more alternative query plans.

Abstract: Embodiments are directed are towards the transparent summarization of events. Queries directed towards summarizing and reporting on event records may be received at a search head. Search heads may be associated with one more indexers containing event records. The search head may forward the query to the indexers the can resolve the query for concurrent execution. If a query is a collection query, indexers may generate summarization information based on event records located on the indexers. Event record fields included in the summarization information may be determined based on terms included in the collection query. If a query is a stats query, each indexer may generate a partial result set from previously generated summarization information, returning the partial result sets to the search head. Collection queries may be saved and scheduled to run and periodically update the summarization information.

Abstract: The present disclosure describes methods and systems for managing a database having a plurality of tables. The tables represent master data of a business application. In one example, a method includes receiving an input command from a user for maintaining a table of the plurality of tables. After receiving the command, an Extensible Markup Language (XML) file corresponding to the table is identified. Thereafter, a screen suitable for enabling the user to perform one or more functionalities corresponding to the input command is prepared. The screen is prepared by using a screen object corresponding to the XML file. Various examples of the functionalities can include, but are not limited to, View, Add, Update, and Delete. Subsequently, a query corresponding to the input command is executed for maintaining the table based on the functionalities.

Abstract: A method of selecting and presenting content based on a comparison of preference signature from multiple users is provided. The method includes providing a set of content items having associated descriptive terms and receiving search input from users. The method includes presenting a subset of content items, receiving content selection actions, and learning users' preferences, wherein the preferences are weighted based on content items usage so that the user preferences are specified as a set of descriptive terms and associated weights. The method includes identifying users with similar preferences by comparing sets of learned user preferences and presenting content items to at least one user of the plurality of users by identifying for presentation content items selected by users identified as having learned user preferences that are similar to the learned user preferences of said at least one user.

Abstract: Systems and methods are disclosed herein for providing search results, particularly product records from a product database. Past queries are analyzed and grouped into clusters according to similarities with one another. For an individual query, relevant search results are identified and departments corresponding thereto are also identified. Confidence scores are determined for the identified departments and if one or more departments have confidence scores above a threshold, the search results are filtered based thereon. If not, then departments corresponding to a query cluster relevant to the query are selected. Additional departments may also be selected based on the number of search results corresponding to the additional departments. Search results filtered according to one or more selected departments are transmitted to an author of the query.

Abstract: A method for a computer system includes receiving a first user communication, determining a first group of users, determining a target number of users, determining whether the first group of users includes the target number of users, and if not, providing the communication to the first group of users, determining a hierarchal mapping of groups of users in response to user memberships, determining a second group of users from the hierarchal mapping, determining a plurality of social network relationship factors for the second group of users with respect to the first user, and providing the communication to at least a subset of users in the second group of users in response to the first plurality of social network relationship factors.

Abstract: The present invention extends to methods, systems, and computer program products for executed stored procedures at parallel databases. Stored procedures are transformed so that execution of the stored procedure is split between a standalone database server and a parallel database coordinator. Execution of the stored procedure is initiated at the standalone database server. At execution time, control-flow statements, variable assignment, expression evaluation, etc., are handled by the standalone database server. SQL statements are passed from the standalone database server to the database for the execution. Results from executed SQL statements can be returned to the standalone database server or to a client. The parallel database coordinator can be added as a linked server to the standalone database server. In some embodiments, a session token is used to share session state between different parties.

Abstract: Various embodiments are generally directed to an apparatus and method for generating a general request having structures and information to perform an analytical calculation on data stored in a distributed database system and converting the structures and information of the general request to a compute request having a request format conforming to a query language used by the distributed database system. Various embodiments may also include sending the compute request to a node of the distributed database system and receiving a compute response from the node of the distributed database system, the compute response including a result set of the analytical calculation performed on data local to the node from an analytic container implemented by the node, the analytic container including an embedded process to replicate an execution environment hosted within the distributed database system used by a client application.

Abstract: Website search results obtained from searching multiple electronic information stores may be displayed transparently without distinguishing the electronic information store. The search may be performed by a web host and may include receiving at least one search term that then is compared with first electronic information within a first electronic information store to determine whether matches exist, where the first electronic information includes content provided by an internal source. The search term also is compared with second electronic information within a second electronic information store to determine whether matches exist, where the second electronic information includes content provided by an external source. Results are displayed based on matches that are determined to exist with the first electronic information and the second electronic information. The results are combined in a single list of results.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for presenting secondary music search result links. In one aspect, a method includes receiving a search query. A plurality of search results that satisfy the search query are obtained. A presentation of the plurality of search results is generated, wherein a particular search result includes one or more secondary music search result links to respective music resources identified by markup language music data in a set of identified music web pages. The presentation of search results is provided in response to the search query.

Abstract: The present invention extends to methods, systems, and computer program products for visually representing queries of multi-source data. Embodiments of the invention can be used to visually represent queries of multi-source data. Visual cues can be used to help surface insights into data sets. For example, keywords can be assigned colors. Within a data set, the keywords can be presented as colored highlights (i.e., individual keywords can be displayed using different colors). Presentation of multiple colored highlighted keywords can be optimized for quick visual consumption. As such, a user can more easily determine the volume of keywords within a data set and can identify trends in keyword volume over time. A “mountaintop view” of an entire data set can be presented to show highlighted words within the data set as color blocks without having to scroll.

Abstract: A service monitoring system receives a selection of key performance indicators (KPIs) that each indicate a different aspect of how a service provided by one or more entities is performing. Each entity of the one or more entities produces machine data or wherein each entity has its operation reflected in machine data not produced by the entity. Each KPI is defined by a different search query that derives one or more values from the machine data pertaining to the one or more entities providing the service, where each of the one or more values is associated with a point in time and representing the aspect of how the service is performing at the associated point in time. For each of the selected KPIs, the service monitoring system derives the one or more values and causes display of a graphical visualization of the derived one or more values for the KPI along a time-based graph lane.

Abstract: In some implementations, a method includes receiving a first data set that is stored using a first format, generating an info item based on the first data set, the info item representing an entity extracted from the first data set, generating a delta item based on the first data set, the delta item including a reference to the info item and defining a context-based modification of the info item, generating a second data set in a second format comprising the info item and the delta item, and storing the second data set to the computer-readable storage medium.

Abstract: Data accessible to a first process is replicated for use by a second process. Modifications to the data during the replication process may cause algorithms requiring the values of data both before and after replication to pause. Sending the values of the datum, before and after modification, to a process that will access the replicated data enables algorithms that use both values to initiate execution without waiting for the replication process to be completed.

Abstract: Systems and methods for use in presenting a hierarchy of data objects. Data objects in a hierarchy are each associated with a node type of a plurality of node types. A graphical representation of the hierarchy is created. The graphical representation includes including a plurality of strata corresponding to the plurality of node types. A plurality of tree nodes representing the data objects is created. Each tree node is associated with the node type that corresponds to the associated data object. The tree nodes associated with the node type that corresponds to the stratum are included in each stratum of the plurality of strata. The graphical representation may include hierarchical connectors extending between the tree nodes and representing hierarchical relationships between the data objects represented by the tree nodes.

Abstract: A method of managing application service provider product line variations is disclosed. The method includes receiving a client customization request, creating a configuration managed file tailored to the client customization request, binding the configuration managed file to at least one customizable resource, and deploying the customizable resource to a data store. The customizable resource is instantiated after disposition at the data store.

Abstract: According to one embodiment of the present invention, a system enables control of database applications. The system comprises a computer system including a database application to provide access to a database system, and at least one processor. The computer system requests retrieval of application specific property information for the database application from a data repository, and applies the retrieved application specific property information to the database application to control operation of the database application. Embodiments of the present invention further include a method and computer program product for controlling database applications in substantially the same manner described above.

Abstract: A system, method, and computer program product for character data compression for reducing data storage requirements in a database system are described. Embodiments include identifying data of a particular character type in a full data page, and identifying usage frequency of each character of the particular character type. Each character is encoded based on the identified usage frequency and stored, with storage requirements for most frequently used characters are reduced.