Abstract: Systems and methods allow for reliably and efficiently managing files stored on a data storage medium associated with a computer system such as a set-top box. In one embodiment a method of managing a file is provided. The method includes: mounting a first file system to a second file system; creating, by the first file system, a virtual file by partitioning a file into a plurality of segments and by linking the plurality of segments in an index file; and sending a file operation request, by the first file system, to the second file system based on the segments of the virtual file.

Abstract: A method for performing block-level incremental backups of file system volumes using a pseudo device layer of a volume manager. A driver associated with a snapshot backup program is configured to back up the full pseudo disk upon receipt of a backup request, and not automatically performed upon startup. Incremental backups are performed thereafter using a driver that has been modified to include a monitor that tracks writes during backups. The standard I/O routine of the kernel is overwritten with an I/O routine that tracks write operations. The volume manager is called back to perform the incremental backup operations upon each write operation. The going down routine of the kernel is also overwritten to track any updates to the volume manager. If the volume manager is updated, the data structure is cleared and future backups are performed from a subsequent full backup.

Abstract: A method for maintaining an index in multi-tier data structure includes providing a plurality of a storage devices forming the multi-tier data structure, caching an index of key-value pairs across the multi-tier data structure, wherein each of the key-value pairs includes a key, and one of a data value and a data pointer, the key-value pairs stored in the multi-tier data structure, providing a journal for interfacing with the multi-tier data structure, providing a plurality of zone allocators recording which zones of the multi-tier data structure are in used, and providing a plurality of zone managers for controlling access to cache lines of the multi-tier data structure through the journal and zone allocators, wherein each zone manager maintains a header object pointing to data to be stored in an allocated zone.

Abstract: Systems and methods are provided herein for garbage collecting data previously tiered to cloud storage. A cloud object index can be generated and used to track objects stored in cloud storage. As objects within cloud storage are added or modified, the transactions can be tracked and the cloud object index can updated based on the activity. Expiration dates associated with cloud objects can be maintained in the cloud object index factoring in user defined retention periods, process defined retention periods for services like backup and snapshots, and regulatory defined retention periods depending on the type of data being tiered. Upon a determination that no active processes are linking to a cloud data object, that an expiration date has been met, and other custom factors, cloud objects can be removed from cloud storage permanently.

Abstract: A computer-implemented method is provided in one general embodiment for concurrent file and object protocol access. The method includes receiving a notification that indicates storage of an object by an object-based client, and creating a clone of the object. Also, the method includes providing a file-based client access to the clone of the object. Further, the method includes, after the file-based client has finished modifying the clone of the object, replacing the object with an updated object based on the modified clone of the object. The file-based client is provided access to the modified clone of the updated object. After the file-based client has finished modifying the modified clone of the updated object, the updated object is replaced with an additional object based on the modification to the modified clone of the updated object.

Abstract: Methods, apparatus, and electronic devices for file management are provided. On a touch screen, whether a duration time of a first pre-set operation to a target file is greater than a first pre-set threshold value can be detected. When the duration time of the first pre-set operation to the target file is detected greater than the first pre-set threshold value, the target file, and other files related to the target file and on an interface of the target file can be determined as files to be managed. According to a second pre-set operation to the files to be managed, a corresponding management to the files to be managed can be performed.

Abstract: Techniques for managing records on a filesystem to enforce a record disposition protocol. Embodiments identify records on the filesystem using one or more record definitions. Each record definition may contain a conditional statement which, if satisfied by a particular file on the filesystem, indicates the particular file as a record. Embodiments may then monitor file activity for each of the identified records and upon detecting the file activity, may enforce the record disposition protocol for the record. Such enforcement may include preventing the file activity, and may further include logging information related to the file activity.

Abstract: An apparatus and a computer-implemented method for processing data are disclosed. The apparatus comprises a memory device that stores first history data, and at least one processor configured to modify a first portion of the first history data, transmit first information to a recipient device reflecting the modification to the first portion of the first history data, determine that the recipient device has modified a second portion of the second history data associated with the first portion based on the first information, receive input data, and responsive to the confirmation, transmit one or more reference tokens reflecting a relationship between the modified first history data and one or more portions of the input data, wherein the one or more first reference tokens allows the recipient device to reconstruct the one or more portions of the input data from the modified second portion of the second history data.

Abstract: As information becomes more accessible to the public, the ability to predict and estimate sensitive data from the data already available to the general public becomes easier. The existing privacy-preserving data mining approaches only consider the information the user is querying and do not consider the information the user already has, and how the user can use that information in combination with the query information to create sensitive data that the user should not have access to. Some embodiments of the present invention provide a query analysis (QA) program that solves the aforementioned problem by taking into account data that a user may already have, whether it is private data or data that is available to the public, and then using that data, along with the data that would be returned in the query, to determine if sensitive data could be recreated.

Abstract: In a directory service, a sync request requesting changes to a dataset is received from a sync client, the sync request comprising a token, and sync requests containing tokens are sent to first and second directory servers. Changes are returned by the directory servers with tokens, and the changes are returned to the sync client with a unified token. In embodiments, the changes returned to the sync client are new to the sync client. Also disclosed is a method where a request for new changes to a dataset is received from a sync client, the request including a token, and a response that contains a token and changes that are new to the sync client is returned.

Abstract: Aspects of the present disclosure are directed to architectures, methods and systems and structures that facilitate the sharing and synchronization of electronically stored files among and between cloud entities and a number of computers, systems, devices and/or users. One particular exemplary aspect includes the mapping and/or translation of files electronically stored in a cloud file system when synchronized and/or shared with client computer systems.

Abstract: A planning indication directed to a declaratively-described operation and a target MPP database is received where the operation includes multiple mid-operation states and the operation includes, for each state in the plurality of states, those types of devices in a MPP database which would be affected by that state if the operation were performed, including a first set of affected device types and a first mid-operation state. In response to receiving the planning indication, affected device(s) in the target MPP database which would be affected by the first mid-operation state if the operation were performed are determined without performing the operation on the target MPP database. This determination is based at least in part on the first set of affected device types included in the operation. The first mid-operation state and the affected devices are indicated in a display.

Abstract: A method of operation of a navigation system includes: determining a navigation component based on comparing a traversal content to a stored content for identifying an object type; determining a content discrepancy based on the navigation component present in the traversal content but unidentified in the stored content; and generating a content filler with a control unit based on the content discrepancy for presenting on a device the navigation component missing in map information.

Abstract: A method for continuous processing of two-level data on a system with a plurality of nodes for processing the data includes determining a system state representing at least one of actual or possible performance capabilities of the system, determining already processed data on the nodes, splitting and assigning high-level input data for processing with lower level data on one or more of the plurality of nodes according to the determined system state, processing requirements of the data and already processed data in a form of at least of lower level data on the nodes such that in case of the already processed data, data to be processed is compared with the already processed data, and input data is split and assigned to the plurality of nodes such that an amount of data to be exchanged for processing the input data on the respective nodes is minimized.

Abstract: A system, computer program, and method for storing and sharing images such as photographs via a communications network (16) and for permitting the identification of objects within the images. The invention allows the identification of objects such as persons within the photos without requiring the person submitting the photos to type in identification information for each and every photo in a photo album. The invention also allows users to automatically share their photos with others and to automatically search for photos and/or certain people in photos.

Abstract: A smart device includes a storage device, an imaging unit configured to capture a photo image, an input unit configured to input data to a predetermined field of a virtual display panel image, an image editing unit configured to create a virtual display panel-added photo image by superimposing the virtual display panel image having the data input to the predetermined field by the input unit on the photo image captured by the imaging unit, a first verification information generating unit configured to generate first verification information with respect to the virtual display panel-added photo image based on at least the photo image of the virtual display panel-added photo image, and a verification information storage unit configured to create a verification information/virtual display panel-added photo image that stores the first verification information and the data input to the predetermined field as metadata of the verification information/virtual display panel-added photo image.

Abstract: A computer-implemented method includes displaying, within a user interface, a view pane having a vertical direction and a horizontal direction, displaying, within the view pane, a plurality of poster frames, each poster frame representing a corresponding media item, a first poster frame being displayed as positioned in a first row extending across the event view pane in the horizontal direction such that the first poster frame is displayed substantially adjacent to a first vertical edge of the event view pane and subsequent poster frames are displayed substantially adjacent to one another in the first row until a poster frame in the first row is displayed substantially adjacent to a second vertical edge of the event view pane, and displaying a next poster frame in a second row vertically displaced from the first row. Photographs in a poster frame can be previewed by moving a cursor across the poster frame.

Abstract: Devices, systems, and methods obtain lists of image identifiers from multiple image repositories; organize the image identifiers in the lists of image identifiers into an image queue, thereby generating an image queue that includes image identifiers from multiple image repositories; and obtain a first image that is identified by a first image identifier in the queue, wherein the first image is obtained from a first image repository of the multiple image repositories. The devices, systems, and methods also add the first image to a display, obtain a first input from a user interface, remove the first image from the display, and change a storage location of the first image based on the first input. And the devices, systems, and methods obtain a second image that is identified by a second image identifier in the queue and add the second image from the image queue to the display.

Abstract: Systems and processor-implemented methods of S-expression based computation of lineage and change impact analysis. An SQL expression is converted into an S-expression tabular structure. A function table including a plurality of functions associated with S-expression tabular structure tabulated against at least one of a function name, a derived column and a derived table and an argument table including plurality of arguments associated with the S-expression tabular structure tabulated against at least one of an argument type, a function identifier linking the arguments to the function table, a computed from function, a reference to entity or a literal value, is generated based on the S-expression tabular structure. At least one of lineage or change impact analysis for an entity is determined based on the function table and the argument table, where lineage provides a provenance of the entity or attribute from a source entity or a source attribute.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing suggestions within a document. In one aspect, a method includes obtaining textual input provided to a document editing application by a user device, the textual input being provided to the document editing application for inclusion in a document; identifying performance measures associated with the current editing session for the document, each performance measure being based on session data obtained from the user device during a document editing session, the session data being for the textual input and prior text that was included in the document prior to the textual input; providing the performance measures as input to a suggestion model that was trained using historical performance measures identified in performance logs for historical document editing sessions of users; and throttling textual suggestions during the current editing session based on the output of the suggestion model.

Abstract: There is provided a method, apparatus and system for indexing content based on relative time information. The method, apparatus and system include determining relative time information of at least one of a time interval of at least a portion of the content and an event occurring in the content, generating time metadata that indexes in absolute time the determined relative time information and communicating the time metadata for storage. The method, apparatus and system can further include receiving a request for the at least one of a time interval of at least a portion of the content and an event occurring in the content, the request identifying a desired content portion using relative time information, using the time metadata to determine a portion of the content relative to the time information and communicating the content portion relative to the time information to a requester.

Abstract: According to one embodiment of the present invention, a system for sorting data records generates a plurality of data structures associated with corresponding record fields used to sort the data records, and inserts values of the record fields into the corresponding data structures. Each of the data structures comprises one or more ordered parts, and each inserted value is inserted into a part of the corresponding data structure. Each part of a data structure corresponding to a record field having a sort priority immediately below another record field corresponds to a distinct value inserted into a part of the data structure corresponding to the other record field. The system processes the generated data structures to determine sorted data records. Embodiments of the present invention further include a method and computer program product for sorting data records in substantially the same manners described above.

Abstract: Systems and methods for article location and retrieval are described. In one described method, the normal processing of an operating system call associated with a dialog control is interrupted, and a search dialog control is displayed. The search dialog control is associated with an index comprising a plurality of events. Each of the plurality of events may be associated with at least one of a plurality of client applications and at least some of the plurality of events can be captured in real time. Each event may be associated with one or more articles.

Abstract: In an embodiment, a method comprises receiving a first record comprising one or more first fields from a first source computer; in response to determining that the first record is a first type and a first node is associated with the first type, sending the first record to the first node to be processed; receiving a second record comprising the one or more first fields and one or more second fields from a second source computer; in response to determining that the second record is a second type and a second node is associated with the second type, sending the second record to the second node; in response to determining that the second type is a first subtype of the first type, sending the second record to the first node to be processed, without suspending the first node.

Abstract: A method and apparatus for processing packets in a network are disclosed. For example, the method scans one or more packets representing a content that is being transferred via the network, where the scanning acquires one or more content elements. The method then builds a keyterm index from the one or more content elements, and stores the keyterm index in a repository. A query handler then responds to queries in accordance with the keyterm index.

Abstract: In a remote index operation, a first system in a datasharing group performs an operation on a data object in a database, determines a second system in the datasharing group has exclusive access to an index page to be updated according to the operation, and sends to the second system a remote request to change the index page according to the operation. In response, the second system changes the index page with an index entry referencing the data object and marks a key in the index entry as a provisional key. When a third system in the datasharing group reads the index entry, it determines that the key in the index entry is the provisional key. In response, the third system determines whether the data object exists in the database and a committed state of the transaction, and accordingly determines a current state of the data object.

Abstract: The present disclosure involves systems, software, and computer implemented methods for generating NER dictionaries from structured business data. In one example, a method may include identifying a set of structured data for use in generating a NER dictionary, identifying a particular collection within the identified structured data to use in the dictionary generation, the particular identified collection including a plurality of values, identifying at least one variant of the value for each value in the particular identified collection, each of the at least one variants of the value including at least a portion of the underlying value, determining a set of unique variants from the identified at least one variants across each of the values in the particular identified subset, adding the determined set of unique variants to the generated dictionary, each unique variant added to the generated dictionary being associated with the value from which the unique variant was derived.

Abstract: The present invention extends to methods, systems, and computer program products for annotating structured data for search. Aspects of the invention include associating structured data, such as, for example, tables, with additional content to improve indexing of the structured data for search and/or provide improved search results for structured data. Web pages can include tables as well as other content. The other content in a web page, such as, for example, content outside the <table> and </table> tags of a web table, can be useful in supporting searches for web tables. Content in one web page can also be useful in supporting searches for a table in another web page.

Abstract: A method for processing a dataset in a partitioned distributed storage system having data stored in a base table and an index stored in an index table, may include receiving base and index table metadata from the partitioned distributed storage system, where the base and index table metadata includes respective table partition information. The method may further include partitioning the dataset into a set of base-delta files according to the base table metadata, and generating a set of index-delta files corresponding with the base-delta files according to the index table metadata. The method may additionally include updating the partitioned distributed storage system with the set of base-delta and the set of index-delta files, where a first update of the base table is synchronous with a second update of the index table.

Abstract: In a large presentation or lecture, multiple questions submitted by the audience may be classified into one or more common questions based on the semantic relatedness of the submitted questions. Further, the common questions may be sorted and presented to a host or lecturer so that the host or lecturer may efficiently answer the common questions.

Abstract: Non-blocking processing of federated transactions may be implemented for distributed data partitions. A transaction may be received that specifies keys at data nodes to lock in order to perform the transaction. Lock requests are generated and sent to the data nodes which identify sibling keys to be locked at other data nodes for the transaction. In response to receiving the lock requests, data nodes may send to lock queues indicating other lock requests for the keys at the data node. An evaluation of the lock queues based, at least in part, on an ordering of the lock requests in the lock queues may be performed to identify a particular transaction to commit. Once identified, a request to commit the identified transaction may be sent to the particular data nodes indicated by the sibling keys in a lock request for the identified transaction.

Abstract: Example distributed reservation systems and methods are described. In one implementation, multiple storage nodes are configured to store distributed data. Multiple clients are coupled to the multiple storage nodes and access data from the multiple storage nodes. A management server is coupled to the multiple storage nodes and the multiple clients. The management server manages the access of data by the multiple clients and manages reservation of the multiple storage nodes by a particular client.

Abstract: A system includes activation of an OData service exposing a parameterized database view, the OData service exposing a Parameter Entity Type and a Result Entity Type, wherein the Parameter Entity Type specifies one or more input parameters of the database view as properties of the Parameter Entity Type, and defines a Parameter Entity Type key formed by each of the one or more input parameters, and wherein the Result Entity Type specifies the one or more input parameters and one or more output of the database view as properties of the Result Entity Type, and defines a Result Entity Type key formed by each of the one or more input parameters and at least one of the one or more output parameters.

Abstract: An embodiment of the invention provides a method wherein a natural language query is received from a user with an interface. An ontological representation of data in a database is received with an input port, including names of concepts and names of concept properties. Template rules are received with the input port, the templates rules being language dependent and ontology independent, the template rules including widely used constructs of a language. Rules are automatically generated with a rule generation engine with the ontological representation of the data in the database and the template rules to identify entities and relations in the natural language query. Entities and relations are identified with a processor, the entities and relations being identified in the natural language query with the rules. The structured data language query is generated with a query generation engine from the entities and relations.

Abstract: Creation of an index for a table of sorted data for use by a data storage application is initiated. Thereafter, N+1 logical partition of rows of the table are defined so that each logical partition has a corresponding worker process. Each worker process then builds a sub-index based on the corresponding logical partition which are later merged to form the index. Related apparatus, systems, techniques and articles are also described.

Abstract: A database management system has a query interface for receiving a query and a query executor for executing the received query. The query executor dynamically generates a task, and executes a plurality of tasks in parallel. In execution of each task, each time data is required to be read from a database, the query executor generates a task for acquiring the data, and in execution of the generated task, issues a data read request for reading the data from the database, to thereby shorten a time taken to execute each task.

Abstract: In one embodiment, a search query is received from a computing device, the search query including one or more search terms. Based on the one or more search terms, one or more entities are identified from a set of multiple entities. Each of the one or more identified entities is associated with one or more application functionalities. In addition, a set of applications are identified based on the one or more search terms. Based at least on a type of at least one of the identified one or more entities, a determination is made that a particular application from the set of applications supports the at least one of the identified one or more entities. Thereafter, the applications in the set are ranked based in part on the determination that the particular application supports the at least one of the identified one or more entities.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for context scoring adjustments for candidate answer passages. In one aspect, a method includes scoring candidate answer passages. For each candidate answer passage, the system determines a heading vector that describes a path in the heading hierarchy from the root heading to the respective heading to which the candidate answer passage is subordinate; determines a context score based, at least in part, on the heading vector; and adjusts answer score of the candidate answer passage at least in part by the context score to form an adjusted answer score. The system then selects an answer passage from the candidate answer passages based on the adjusted answer scores.

Abstract: A method and a device for adjusting filter parameters comprises a display, a physical user interface, a memory and a processing unit. The memory comprises a sorted list of items in an ordered manner, the order determined by their rank, and each item has at least one feature-value pair that represents a value of a feature of the item. The processing unit generates a graphical representation of the items in the list in an ordered manner on the display. The processing unit responds to the user interface so as to allow a user to re-order (rearrange) and/or drop items in the graphical representation of the list of items; it modifies the rank of the items in the list, and it determines a like-degree for at least some of the feature-value pairs.

Abstract: In some examples, a computing device may be configured to simulate the deduction process of human mind by generating new data based on existing data and newly received data that is semantically relevant to the existing data.

Abstract: In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, identifying a nodes corresponding to a page currently accessed by a first user, generating one or more structured queries, where each structured query comprises a reference to the identified node and one or more edges that are connected to the identified node, and transmitting one or more of the structured queries to the first user for display on the page.

Abstract: Each access event for a plurality of business objects is logged. Using the log, a user profile for each of a plurality of users is generated that identifies one or more recently accessed business objects. A relevance value for each business object identified in the user profile is calculated and an aging function is applied to the calculated relevance values. The relevance information can graphically rendered.

Abstract: In one embodiment, a method includes receiving, from a client device of a user of an online social network, an input from the user to access a card-stack interface, generating a plurality of cards, where each card comprises a suggested query referencing a query-domain associated with the online social network and one or more query-filters, and where each query-filter references one or more objects of the online social network, each card further comprising one or more search results corresponding to the suggested query, and each search result referencing an object of the online social network matching the suggested query of the card; and sending, to the client device in response to the input from the first user, the card-stack interface for display to the first user, wherein the card-stack interface comprises one or more of the generated cards.

Abstract: In one embodiment, a search request is received from a first user, the request including the first user's location. A set of search results and their corresponding geographic locations are determined in response to the search request. For each search result, a weighted rating value is determined based on user ratings provided by one or more second users, an affiliation coefficient between the first user and each second user providing a user rating, and a proximity coefficient based on the distance between the first user's location and the geographic location of the search result. The search results are ranked by their respective weighted rating values and sent to the first user.

Abstract: A search result is modified to include a predetermined number of channels within a predetermined number of a plurality of entries in the search result. The search result is generated in response to a search query. The search result is modified to comprise a predetermined number of channels within a predetermined number of the plurality of entries. The modified search result is updated based on the plurality of entries and a subset of the updated modified search result is selected to be presented in response to the search query. The subset of the updated modified search result comprises the channel and at least one selection of data content.

Abstract: The invention relates to a computer-implemented method for processing a query in a database, the query comprising a search value. The database comprises a plurality of datasets the datasets comprising entries, wherein distance statistics are assigned to the datasets. The distance statistics describe the minimum and maximum distance between the values of the entries of a dataset of the plurality of datasets and a reference value. The method comprises determining the distance between the search value and the reference value, said determination resulting in a search distance, determining a subset of datasets from the plurality of datasets for which the search distance is within the limits given by the minimum and maximum distances described by the respective distance statistics, and searching for the search value in the subset of datasets.

Abstract: A method to search for at least one relationship pattern in a plurality of runtime artifacts is provided. The method may include detecting at least one data manipulation statement in the plurality of runtime artifacts. The method may also include extracting at least one relationship clause from the detected at least one data manipulation statement. The method may further include parsing the extracted at least one relationship clause. The method may include generating at least one normalized syntax tree based on the parsed at least one relationship clause. The method may also include performing a classification and a snippet discovery on the generated at least one normalized syntax tree.

Abstract: A method comprises selecting at least a first data set and a second data set on which to apply a query. The method also comprises causing generating of a first cursor based and a second cursor based on a first application of the query on the first data set and a second cursor based on a second application of the query on the second data set. A third cursor based on a combination of a result set returned by the first cursor and second cursor is then generated in response to the query.

Abstract: Methods and systems for determining schema element types are shown that include pooling potential annotations for an element of an unlabeled schema from a plurality of heterogeneous sources, scoring the pool of potential annotations according to relevancy using information using instance information from the plurality of heterogeneous sources to produce a relevancy score, and annotating the element of the unlabeled schema using the most relevant potential annotations.

Abstract: Disclosed are systems, methods, and non-transitory computer-readable storage media for shared folder backed integrated workspaces. In some implementations, a content management system can provide a graphical user interface (GUI) that integrates communications and content management into a single user interface. The user interface can include mechanisms that allow a user to provide input to generate a new workspace. The user interface can provide a mechanism to allow a user to view conversations related to the workspace and/or content items associated with the workspace. The user interface can present representations of content items associated with the workspace and allow the user to provide input to generate, view, edit, and share content items associated with the workspace.