Abstract: The invention relates to a data processing system, comprising at least two disk emulators operating in parallel and emulating a disk subsystem each, the disk emulators each using a file in a file system for any data stored on the respective disk, a separate de-duplicator for de-duplicating the data stored in the files, the de-duplicator operating in parallel to the disk emulators, the de-duplicator further using an additional disk emulator emulating an additional disk subsystem by using an additional file in a file system for storing data shared between the other disk subsystems.

Abstract: A system, a method, and a computer readable media for identifying a user-initiated log file record in a log file are provided. The log file has a user-initiated log file record and a repeating pattern of log file records automatically generated by a software program. The system allows a user to identify first and second timestamp values corresponding to first and second times which identify a time interval of interest in the log file. The system further analyzes the log file to identify the user-initiated log file record having a timestamp value between the first and second timestamp values. The system further identifies the repeating pattern of log file records in the log file.

Abstract: Systems and methods for normalizing entities via name normalization are disclosed. In some implementations, a computer-implemented method of identifying duplicate objects in a plurality of objects is provided. Each object in the plurality of objects is associated with one or more facts, and each of the one or more facts having a value. The method includes: using a computer processor to perform: associating facts extracted from web documents with a plurality of objects; and for each of the plurality of objects, normalizing the value of a name fact, the name fact being among one or more facts associated with the object; processing the plurality of objects in accordance with the normalized value of the name facts of the plurality of objects. In some implementations, normalizing the value of the name fact is optionally carried out by applying a group of normalization rules to the value of the name fact.

Abstract: Disclosed is a system and methods for data compression and decompression. The systems and methods discussed herein include an encoder, dictionary, decoder, literal string and control output. The discussed systems and methods encode data transmitted over a communications channel through the use of a dynamically compiled dictionary. Upon reviewing the characters within the transmitted data in view of the dictionary, an encoded/compressed output string is created. Such output string may also be decoded in a similar fashion via a dynamically compiled dictionary.

Abstract: Genetic data may be compressed efficiently by selecting for each bi-allelic marker, from among multiple compression algorithms with different associated storage requirements that depend on the minor allele frequency of the respective marker, the algorithm that has the lowest storage requirements. Efficient approaches compress, store, and load pedigree file data. A hybrid method is used that selects between multiple alternative compression algorithms whose performance depends on the frequency of certain observable genetic variations. The hybrid method may achieve higher compression ratios than PLINK or PBAT. Further, it results in a compressed data format that, generally, does not require any overhead memory space and CPU time for decompression, and, consequently, has shorter loading times for compressed files than the binary format in PLINK or PBAT.

Abstract: According to an embodiment, a data compression device includes a receiving unit, generating unit, a selecting unit, and a compressing unit. The receiving receives input data pieces. The generating unit generates starting point candidates representing the data having an error within a threshold value with respect to starting point data input at a first timing. The selecting unit refers to the starting point candidates, end point data input at a second timing, and intermediate data input at a timing in between the first timing and the second timing; and selects the starting point candidate which, as compared to the other candidates, has a greater number of pieces of the intermediate data approximated using the starting point candidate and using the end point data in such a way that the error is within the threshold value. The compressing unit outputs the selected starting point candidate and the end point data.

Abstract: System and methods for storage object distribution using dynamic policy controls are provided. An embodiment method deleting an object in a distributed storage system includes receiving, from a client, a delete request for an object, retrieving, by a primary datacenter, an object metadata list corresponding to the object to be deleted, and inserting, by the primary datacenter, a delete marker on a top of a stack data structure in an object metadata list.

Abstract: A computer-implemented method for data management of product variants in control unit development is provided. Consistent data management is ensured by initially specification of product features in a variant model, specification of components in at least one domain, and definition of feature/component dependencies by associating components with at least one product feature, and subsequently specification of at least one product variant of interest by selecting product features, specification of at least one domain of interest, automated identification of the components pertaining to the product variant of interest through automated evaluation of the feature/component dependencies, and automated output of the identified components.

Abstract: Provided is an apparatus for providing a transaction sharing hybrid interface of a session. The hybrid interface includes a direct interface, of an imperative application programming interface (API), which retrieves or modifies data in database tables by bypassing a query processor (QP) layer and directly accessing a storage manager (SM) layer, and a SQL interface, of a declarative API, which retrieves or modifies data in database tables by going through the query processor layer before accessing the storage manager layer. From among one or more queries in one transaction of a session, the direct interface performs simple queries, and the SQL interface performs queries other than the simple queries.

Abstract: A method of performing a digital search, wherein the result set returned is additionally narrowed via a virtual personality, represented by an animated avatar selected by the user prior to enacting the search. The avatar consists of a virtual identity, which, when reduced to keyword characteristics and then applied to a search algorithm, enables the filtering of result sets according to the inferred desires of the hypothetical individual instantiated by the virtual identity itself, expressed as an avatar.

Abstract: An Internet search apparatus includes a current location detection unit configured to detect a current location, an administrative district name acquisition unit configured to acquire a name of an administrative district to which the current location belongs, and an information search unit configured to perform an Internet search and display a search result in the form of a list such that a web page that does not include the administrative district name is excluded.

Abstract: A method, process, and associated systems for ranking elements of an answer set retrieved by a conceptual search engine in response to a set of queried concepts submitted as a conceptual query. A processor of a computer system orders by relevance the semantic schemas that make up the retrieved answer set by first identifying a weight of each concept in a retrieved schema as a function of relationships among the concepts in that schema, then by identifying a semantic value of each queried concept in the retrieved schema as a function of the weights, and finally by identifying a semantic value of the query in the schema as a function of the semantic values of all queried concepts. The relative relevance of each schema may then be identified as a function of the semantic value of the query in that schema.

Abstract: Methods for analyzing a Uniform Resource Locator (URL) and apparatus for performing such methods. The methods include parsing the URL into text segments and generating n-grams from the text segments. The methods further include generating annotations, each annotation corresponding to one of the n-grams and comprising a match value for its corresponding n-gram, a description of its match value, and a score. The methods still further include selecting a subset of the annotations.

Abstract: A method for calculating a content subset can include crawling a number of webpages for content, determining a relevance to a particular domain of the content, determining a penalty value for each of the number of webpages; and calculating, utilizing a data tree-based model, a subset of the content to analyze based on the relevance and the penalty value.

Abstract: Methods and systems for enhancing online content with creative text relevant to the online content are provided. A plurality of candidate sitelinks is identified in response to a user search for online content. Each sitelink has associated with it a plurality of candidate creatives with which the sitelink may be presented to the user. The creatives are canonicalized to form clusters of candidate creatives. The sitelinks are also canonicalized. The creatives are matched to the candidate canonicalized sitelinks so as to provide enhanced sitelinks having increased relevance to the user search.

Abstract: Architecture that utilizes geotiles to return locally relevant results across a geographically distributed set of locations. As applied to retail operations the business entity may have a retail presence in many different geographical areas (e.g., regions) of a country. Each retail presence is processed to obtain the associated geographical coordinates, which are then utilized to select one or more geotiles of a mapping system. The geotile(s) for those geographical coordinates are than identified and related to the location. The business entity may be associated with a deal (offer) that is queried using a search engine. The relationships of the deal, retail stores, geographical coordinates of the retail stores, and related geotiles are memorialized in a feed document. Thus, when a query is made for the deal, the search engine accesses the feed document and returns the geotiles for visual presentation of the associated retailer as part of the search result.

Abstract: Embodiments of a method and apparatus of image search are provided. An exemplary method of image search includes: receiving a request and returning a web page, where the returned web page allows uploading an image and adding annotation content for the image; receiving and storing the image and the annotation content for the image; and providing the annotation content for the image as a search index to an image search engine. Using the disclosed method and server, more searches related to information in an image can be provided. Moreover, because more information related to merchandise in an image can be provided to a viewer, it is believed that more online transactions can be facilitated.

Abstract: A system to optimize layout of database objects in a relational database management system stored on a plurality of storage classes each characterized by a price and a storage capacity includes a time-based query optimizer and a layout recommender coupled to the time-based query optimizer to estimate a total cost of operation (TCO) for a query workload on each data layout. The layout recommender includes an auxiliary object selection comprising database objects that include auxiliary objects that are optional to place with auxiliary object candidates being given from an auxiliary object recommender component.

Abstract: Partitioned join operations are performed between a first database object and a second database object by determining an agent group for an agent in response to the agent receiving rows of the second database object to process; partitioning the rows to determine a target hash table for each row and adding the partitioned rows to work to be performed by the agent group; and distributing the work for the group to agents of the group by assigning to a single agent all the rows associated with a particular hash table to perform a join operation on the assigned rows. Each partition is assigned a first counter value indicating an upper bound of a task id range that is most recently assigned to an agent in the agent group for processing, and a second counter value indicating the highest task id that has been processed for that partition.

Abstract: A weight is determined for each of a plurality of join predicates for a join between one or more first database objects and one or more second database objects based on a join selectivity for each of the plurality of join predicates. The plurality of join predicates are sorted based on the determined weights. The join operation is performed joining the one or more first database objects with the one or more second database objects in accordance with an order of the sorted plurality of join predicates.

Abstract: Embodiments of the invention relate to processing queries that utilize fact and/or dimension tables. In one aspect, a pre-join filtering phase precedes a star join. The necessary conditions for the pre-join filtering are considered for a given SQL query, including an estimated size of the hash table exceeding a threshold and presence of a local predicate either on the fact table or one or more dimension tables that is not a large dimension table. Once the necessary conditions are satisfied, the execution of the query exploits the pre-join filtering to build a pre-join output filter from columns of a reduced fact table that joins with each large dimension table. Thereafter, all the dimension tables and the fact table are joined in a star join while exploiting each pre-join filter. Accordingly, the order of when joins occur is changed in order to reduce the size of the fact table and to work from the fact table to reduce the size of large dimension tables.

Abstract: A technique for factoring uncertainty into cost-based query optimization includes: determining the degree of uncertainty involved in the cost estimates for the query, determining the degree of sensitivity the query has to that uncertainty, and determining if there is an access path that performs well across the range of possible conditions that could occur at execution time, reducing the risk of performance spikes and performance volatility. If such an access path exists, select that access path; if not, perform parametric query optimization or query re-optimization.

Abstract: Disclosed herein are system, method, and computer program product embodiments for performing resource estimation for query optimization. An embodiment operates by generating a subplan for which an optimization process may be invoked, predicting performance and resource consumption for optimizing the subplan by measuring similarity between a hypergraph of the subplan and one or more etalon queries having known performance and resource consumption properties, selecting an algorithm for optimizing the subplan from a plurality of optimization algorithms based on the performance and resource consumption properties, and generating an optimized access plan using the selected algorithm.

Abstract: According to one aspect of the invention, for a database statement that specifies evaluating ranking or cumulative window functions, an execution strategy based on an extended data distribution key may be used for the database statement. In the execution strategy, each sort operator of multiple parallel processing sort operators computes locally evaluated results of a ranking or cumulative window function based on a subset of rows in all rows used to evaluate the database statement, and sends the first and last rows' locally evaluated results to a query coordinator. The query coordinator consolidates the locally evaluated results received from the multiple parallel processing sort operators and sends consolidated results to the sort operators based on their respective demographics. Each sort operator completes full evaluation of the ranking or cumulative window functions based at least in part on one or more of the consolidated results provided by the query coordinator.

Abstract: According to one aspect of the invention, for a database statement that specifies rollup operations, a data distribution key may be selected among a plurality of candidate keys. Numbers of distinct values of the candidate keys may be monitored with respect to a particular set of rows. Hash values may also be generated by column values in the candidate keys. The data distribution key may be determined based on results of monitoring the numbers of distinct values of the candidate keys as well as the frequencies of hash values computed based on column values of the candidate keys. Rollup operations may be shared between different stages of parallel executing processes and data may be distributed between the different stages of parallel executing processes based on the selected data distribution key.

Abstract: An information (ERP/EAM) system and equipment taxonomy for representing and managing of equipment, equipment subunits and component parts thereof across an enterprise that maps materialized physical objects to functional physical objects within a hierarchy of functional locations within the enterprise for all enterprise assets in accordance with applicable industry standards. The ERP/EAM system and the equipment taxonomy also provide multi-leveled failure reporting.

Abstract: A corrected optical property value of an optical property of interest captured within a digital image is determined. A search query based on the corrected optical property value is determined. A database is searched using the search query to determine search results for the search query that have appearance attributes with optical properties at least similar to the corrected optical property value.

Abstract: According to an example, data pertaining to a plurality of entities recommended for a user may be accessed, in which the data identifies relationships between the plurality of entities with respect to each other. In addition, a relevance map for the user that displays graphical representations of the plurality of entities over a substantially optimized use of space available for display of the graphical representations in the relevance map may be generated, in which the graphical representations of the plurality of entities are arranged in the relevance map according to a predetermined arrangement scheme.

Abstract: Methods, systems, and computer program products for visually representing and displaying data are described. One or more cells may be selected from a plurality of displayed cells in a crosstab, wherein the subset of cells has a context defined at least by one or more rows and one or more columns. An effect may be selected to apply on the subset of cells, wherein the effect includes an embedded query including parameters drawn from context of the subset of cells. A selected effect on a subset of the plurality of displayed cells may be applied. Effects may include lens effects, brush effects, and box-in/box-out effects.

Abstract: A method includes consulting a database that includes a first entry indicating amounts of time that a first service provider machine takes to perform individual actions of the plurality of actions and a second entry indicating amounts of time that a second service provider machine takes to perform individual actions of the plurality of actions; generating a first estimate for the amount of time the first service provider machine is expected to take in processing the requested service, wherein generating the first estimate includes summing times associated with the plurality of actions from the first entry; and generating a second estimate for the amount of time the second service provider machine is expected to take in processing the requested service, wherein generating the second estimate includes summing times associated with the plurality of actions from the second entry.

Abstract: An infrequency calculating device includes: an keyword obtaining unit configured to obtain a target keyword from a content item; a target content counting unit configured to count the number of target content items which satisfy a condition corresponding to the target keyword, among a plurality of content items including the content item; a specific content counting unit configured to count the number of specific content items including the target keyword, among the target content items; and an infrequency calculating unit configured to calculate an infrequency of appearance of the target keyword based on the number of target content items and the number of specific content items.

Abstract: Embodiments are directed towards determining and tracking metadata for the generation of visualizations of requested data. A user may request data by providing a query that may be employed to search for the requested data. The query may include a plurality of commands, which may be employed in a pipeline to perform the search and to generate a table of the requested data. In some embodiments, each command may be executed to perform an action on a set of data. The execution of a command may generate one or more columns to append and/or insert into the table of requested data. Metadata for each generated column may be determined based on the actions performed by executing the commands. The table of requested data and the column metadata may be employed to generate and display a visualization of at least a portion of the requested data to a user.

Abstract: A search device comprises a memory device for storing document data containing search target character strings to which delimiting characters are appended at both ends; an acquirer for acquiring keywords; a generator for generating a search character string by appending delimiting characters to both ends of the keywords; a designator for designating appearance positions where those extracted partial strings from the search character string appear in the search target character string of the document data; a determiner for determining the frequency with which partial strings common to the partial strings of the search character string appear with a positional relationship similar to the search character string in the search target character string; an evaluator for evaluating the degree of similarity between the search target character string and the search character string; and an output device for outputting the search target character string.

Abstract: A method and system for users to connect, extract, query and transform data from multiple databases, independent of their format, type, and location. The system comprises a setup portion, a meta database, and a user portion. The setup portion establishes datasets for use by the system with the user portion. The meta database stores the datasets. The user portion allows a user to input a query and processes the query to gather information from at least one data source and generate a response.

Abstract: To provide a search system for requesting a user to select any of a plurality of options and searching based on a result of selection by the user, capable of assisting the user so as to readily select an option. A selection screen display control unit (72) displays on a display unit a selection screen showing a plurality of lower node information items corresponding to a plurality of lower nodes positioned immediately below the current node in a tree structure in which a search condition and a node are correlated with each other. A search result screen display control unit (76) displays on the display unit a search result screen showing a list of information items satisfying a search condition corresponding to the nodes from the top node to the current node.

Abstract: Provided is a method comprising: maintaining forward network structure information that, with stages arranged in a multilayer structure and each stage including one or more nodes associated with one or more words and associated in whole or in part with a point, connects nodes included in different layers with each other, in order from a higher layer toward a lower layer in a network state; acquiring one or more search word to use for a search; acquiring a node including all or part of the acquired search words and converting the acquired search words into a point; and using the forward network structure information to calculate points by sequentially adding together in a manner to inherit points, in node units of each layer, the points associated with the acquired node along all paths connected by these points from a topmost layer to the node of a predetermined layer.

Abstract: A system is disclosed for using features of source code to provide more relevant search results in a timelier manner. The system includes at least one processor and a memory storing instructions configured to cause the system to calculate a priority score for each file in associated with a code repository. The priority score is based on at least one of a version score, a build status score, a momentum score, and a social score. The instructions may cause the system to store the priority score in a memory. The instructions may also cause the system to receive a search query, use the stored priority scores to identify files in the code repository responsive to the query, and generate data used to display the identified files. The display may include depictions of the scores used to calculate a priority score for the identified files.

Abstract: An approach for adjusting ranked search results based on user data is provided. An approach includes: receiving a search query from a search user; generating a ranked result set based on the search query; generating an adjusted ranked result set by adjusting the ranked result set based on a skill rating of the search user; and providing the adjusted ranked result set to the search user.

Abstract: In one embodiment, a method includes receiving a plurality of search results based on a search query from a user. A computing system determines a plurality of scores for each search result, each score generated by applying a distinct scoring function of a plurality of scoring functions to the search result. The computing system generates a plurality of diversity groups, each diversity group corresponding to a scoring function of the plurality of scoring functions, each diversity group including at least a subset of the plurality of search results ordered according to the scores generated by applying the scoring function to the at least the subset of the plurality of search results. The method further includes selecting at least one of the plurality of search results from each diversity group and sending the selected search results to the user.

Abstract: Systems and methods for searching for information within social networks are described. In some examples embodiments, a search assist system receives a query, such as a partial query, identifies two or more categories of data that include information satisfying the query, ranks the identified categories of data based on various selection criteria, and presents suggested search terms based on the rankings.

Abstract: A system and method of discovering provider contact data is provided. Provider connectivity data can be built and maintained in a data-store. Once a query is received for identifying a provider contact's data, connectivity data for the querying data is also built. Then the provider connectivity data is searched on the basis of the seeker connectivity data. One or more provider contacts are identified based on query criteria. The provider connectivity data includes a first level provider association data and a first level provider relations data. The seeker connectivity data includes a first level seeker association data and a first level seeker relations data. The connectivity data can be obtained from a variety of sources including contacts databases and third party service providers. Third party service providers include social networks and information aggregators.

Abstract: In various embodiments, a method of prioritizing search results in an electronic environment is disclosed. The method includes selecting a plurality of equivalent keywords responsive to a search query from an end-user, determining a rank of each of the plurality of equivalent keywords, selecting a plurality of most highly ranked keywords from the plurality of equivalent keywords, and preparing a response including the plurality of most highly ranked keywords.

Abstract: An approach is provided for determining the intent of a question and determining an appropriate audience to answer the question based on the intent of the question. The approach comprises processing and/or facilitating a processing of a query to cause, at least in part, a determination of one or more topics of the query based, at least in part, on one or more user preferences. The approach also comprises processing and/or facilitating a processing of the query to cause, at least in part, a determination of a classification of the query, The approach further comprises determining an audience comprising one or more candidate audience members for the query based, at least in part, on the classification of the query and the one or more topics of the query.

Abstract: Techniques for correlating social media data with location information are described. In at least some embodiments, social media data is gathered from a social media platform, and the social media data is processed to determine correlations between topic information from the social media data and locations. The correlations can be aggregated to generate a database of social media information. The database can be searchable with various search terms to determine interest levels at different locations for topics associated with the social media data. Results of such a search can be provided in a variety of ways, such as via maps, tables, and so on.

Abstract: A system and method for disambiguation of a query is provided. The system and method identifies elements of a query which may be ambiguous and assists a person to resolve any ambiguous elements. Algorithmic processing may provide auxiliary information which may be selectively presented with a query and/or a response to a query.

Abstract: Network system provides a real-time adaptive recommendation set of documents with a high statistical measure of relevancy to the requestor device. The recommendation set is optimized based on analyzing text of documents of the interest set, categorizing these documents into clusters, extracting keywords representing the themes or concepts of documents in the clusters, and filtering a population of eligible documents accessible to the system utilizing site and or Internet-wide search engines. The system is either automatically or manually invoked and it develops and presents the recommendation set in real-time. The recommendation set may be presented as a greeting, notification, alert, HTML fragment, fax, voicemail, or automatic classification or routing of customer e-mail, personal e-mail, job postings, and offers for sale or exchange.

Abstract: Systems and methods for searching for information within social networks are described. In some examples embodiments, a search assist system receives a query, such as a partial query, identifies two or more categories of data that include information satisfying the query, ranks the identified categories of data based on various selection criteria, and presents suggested search terms based on the rankings.

Abstract: Systems and methods for providing a social media tool that permits users to identify “what to do” in a particular geographical area in real-time. This is accomplished by utilizing the rate of support (or “likes”) localized topics receive from users in a particular geographical area. A topic can be a place, activity, event, concept, value, brand, etc. A user may operate an application on a computing device to see a list of popular topics in their area. The area may be any defined geographical area, such as a city, stadium, event, etc. The users can like topics, add new topics, add photos, comments, or other content to topics, and subscribe to (or “follow”) their favorite topics. Users can view topics in any geographical region, but they can only contribute likes or content for the particular geographical area in which they are present.

Abstract: Provided is a method, device and computer storage medium for adding information of friends, and said method includes following steps: acquiring a user ID of a user and a friend ID of a friend of the user from a first network relationship list; according to said user ID and said friend ID, acquiring second correlation information corresponding to said user and said friend from several second network relationship lists; according to said second correlation information, determining first correlation information corresponding to the user and the friend in said first network relationship list, and adding said first correlation information into said first network relationship list. The method and device for adding information of friends provided in the present disclosure can accurately recognize the correlation information corresponding to the user and the friend on the basis of existing network relationship lists, and automatically add remark information for friends of the user.

Abstract: Systems, methods, and computer-executable instructions described herein generally relate to increasing user productivity in reviewing query results by surfacing a set of documents ranked by their relative value calculated as a tabulation of how often they are cited for a specific purpose. A database management system can access an index of metadata corresponding to a set of content items in a corpus/corpora of electronically stored content. A sub-system is configured to receive a query request entered by a user in said interactive GUI.