Abstract: An approach is provided for providing a user with a ranked list of possible physical addresses in response to an address submitted by the user. An address submitted by a user is parsed and a number of possible candidate addresses are generated from the user provided address. The quality of the candidate addresses is ranked according to the quality of their individual address elements and factors applied to these elements. An overall quality score for each candidate address is thereby derived. The list of candidate address is displayed to the user according to overall quality score ranking.

Abstract: A content search system determines whether an input string matches a negative regular expression that includes a negative pattern and an optional positive pattern. If the input string matches the positive pattern and does not match the negative pattern, a match between the input string and the negative regular expression is indicated. The positive pattern and the negative pattern may be compared to the input string in a single pass of the input string. The content search system may be implemented in a content addressable memory (CAM) device. The negative regular expression may specify a particular portion of the input string, such as a range of characters or bytes of a data packet, in which the negative pattern should not match for a match between the negative regular expression and the input pattern to be indicated.

Abstract: The disclosed methods, systems, and computer-program products allow a business to generate data quality indicators for relationships in a database. In an embodiment, one or more relationships linked to a customer are retrieved from a database to form a set of relationships. A match confidence code is generated for each relationship based on a score generated by the comparison of customer data associated with the respective relationship and corresponding customer data obtained from an external industry database. A link confidence code is subsequently determined for the customer based on a score generated by the scores used to define the match confidence code for each relationship in the set of relationships and on internal data associated with each relationship in the set of relationships.

Abstract: A system may receive a search query. The system may further provide a list of first documents relating to the search query in a first area of a user interface and provide additional information that has been retrieved from the first documents in a second, different area of the user interface. The additional information includes an attribute name and an associated attribute value.

Abstract: Methods and apparatus define a user interface for a computer program after execution of the computer program has begun. A user interface for the program is defined by: associating a map component and a fashion component on the fly at run time to generate the user interface; and executing the user interface with the associated function and appearance.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating character expressions to determine relationships among such character expressions. In particular embodiments, a character expression may be represented as a concatenation of binary representations of individual characters in the character expression to provide a binary string. The binary string may then be processed by applying a binary arithmetic operator to provide a comparison.

Abstract: A terminal stores in a storage section content distributed from a server and a data access power for deleting a service that differ from a service to which the content belongs in association with each other. The terminal determines, when the stored content requests the deletion of the differing service that is indicated by the statement contained in the content, whether or not the content and the data access power are stored in the storage section in association with each other. When the terminal has determined that the content that requested the deletion of the differing service and the data access power are stored in the storage section in association with each other, the terminal deletes content that belongs to the differing service from the storage section.

Abstract: The patent application taught an object based information storage, search and mining system and method, which can store, retrieve, and mine massively amount of object data efficiently. A first embodiment includes an object based search engine which can organize and identify the objects efficiently from the search space based on certain operational measure quantifying the search objectives. A second embodiment includes an operational measure estimator which can adaptively adjust or reconfigure itself to improve the accuracy of the estimation. A third embodiment includes a method for mapping objects onto a topological maps to enable identifying objects rapidly from the search space according to certain measures for search objectives. A forth embodiment includes a method for conducting object based search through mapping query objects and search objects onto topological maps and searching effectively through the maps based on certain operational measures.

Abstract: Disclosed herein are a method, an apparatus, and a computer readable recording medium for a search using extension keyword. According to an aspect of the present invention, there is provided a method for a search using extension keyword, the method including mapping search keywords transmitted from a user terminal to at least one concept keyword, extending the concept keyword to plurality of concept keywords having association with each other so that a concept keyword extension data-set is generated, and generating extention keywords corresponding to the concept keyword extension data-set.

Abstract: Systems and methods for presenting a content summary of a media item to a user based on a position within the media item are disclosed herein. According to an aspect, a method may include receiving identification of a position within a media item residing on an electronic device. For example, the identified position may be a bookmarked position within an e-book residing on an e-book reader. The method may also include generating a content summary for a portion of the media item based on the identified position. For example, an electronic device may dynamically generate a content summary based on content of the e-book that precedes a bookmarked position. The method may also include presenting the content summary to a user of the electronic device. For example, a display of an electronic device may be controlled to present a content summary to a reader of an e-book.

Abstract: Described herein are systems and methods for providing data policy management over application objects in a storage system environment. An application object may comprise non-virtual or virtual objects (e.g., non-virtual-based applications, virtual-based applications, or virtual storage components). An application object manager may represent application objects by producing mapping graphs and/or application object data that represent application objects in a standardized manner. A mapping graph for an application object may describe a mapping between the application object and its underlying storage objects on a storage system. Application object data may describe a mapping graph in a standardized format. Application object data representing application objects may be received by an application policy manager that manages data policies on the application objects (including virtual applications and virtual storage components) based on the received application object data.

Abstract: A structured file includes information to bind a web data source to a web data query system. Code is embedded within the structured file and is in a code language understood by the web data query system. The code is unrestricted in function. Code language objects are exposed within the web data query system for use by the code to interface with the web data query system and the web data source. A URL is associated with the structured file to enable access of the structured file through the Internet. A unit-based quota method is implemented to manage execution of code in the structured file. The unit-based quota method collapses multiple dimensions of computing resource control into a single unit value, tracks a number of units expended by the code, and stops execution of the code when the number of units expended by the code reaches a set limit.

Abstract: Described are techniques to facilitate temporal features in a semantic data store. Information about lifetimes of facts in a semantic store is maintained. Even when a fact is logically deleted, a physical record is kept available. The record of a logically deleted or invalid fact has associated lifetime information. For example, valid-from and valid-to time values. The record of a fact not yet deleted may have a valid-from time value indicating when it was created, became valid, etc. Queries against the semantic store may specify a timeslice (a point in time or a time range). The lifetime information can be used to satisfy such time-specific queries. Because records are maintained after they are logically deleted, it is also possible to accurately query a past state of the semantic store. Even if such a query is run at different times, same results may be obtained.

Abstract: Embodiments of the invention are generally related to data processing, and more specifically to retrieving results for a query from one or more devices coupled to a network. A first device may receive an abstract query including logical fields defined by a first data abstraction model and retrieve query results stored in the first device. The query may be sent to one or more other devices via the network. The one or more other devices may be configured to convert the abstract query to local abstract queries including logical fields defined in local data abstraction models. The local queries may be issued against local databases to retrieve additional results for the query.

Abstract: Computer-implemented methods for mapping an element of a source information model to an element of a target information model, forming a cluster of elements for mapping across information models, and evaluating a mapping of elements across information models, and a system and computer program product thereof. The method of mapping an element of a source information model to an element of a target information model includes: receiving information for mapping a first element in a source cluster to an element in the target information model; mapping the first element to the target element using the received information for mapping the first element to the target element; and mapping all other elements in the source cluster to the target element.

Abstract: The objective of the present invention is to manage reference movies using an index file, without causing the user to be perplexed. the reference movies are generated because of, for instance, the upper limit of the file size. The index file manages sets of information regarding the files being managed. Examples of these sets of information are information for determining whether or not a file is presented to the user, information for determining whether or not a file is original, and information indicating whether or not nondestructive editing has been done. Based on such information, the erasure, displaying a list, and so on are carried out. Thus, it is possible to manage the reference movies using the index file, without causing the user to be perplexed.

Abstract: Methods and apparatuses enable a generic mapping tool accessible to multiple applications. One or more of the applications may invoke the mapping tool to map objects to each other with a defined relationship. The mapping occurs dynamically during the run-time of the application. The flexibility of the mapping tool enables the use of standard mapping mechanisms.

Abstract: Input data queries directed at a plurality of target databases and originating from any of a plurality of sources are first converted to validated canonical forms, which are then used to query the target databases. Specifically, upon receiving an input data query, a relatively accurate reference database is selected based on the type of the input data. This reference is then queried for the input data with the intent of finding an exact matching record or a near-matching record that can be considered an exact match and thereby validating the input data. Otherwise, the requesting source is instructed to provide a new query. Once having a validated record, it is converted to a canonical form, which is then used to query the target databases intended to be searched. In a further embodiment, multiple reference databases are queried to determine a canonical form of the data or to determine multiple canonical forms of the data.

Abstract: A computer-implemented method, computer-implemented system, and a computer program product for answering a database-based query of a computerized database system. The method includes: generating a canonical individual ind? with respect to a role and a concept, for an existential restriction in an ontology used in the computerized database system; converting implicit data in original data into explicit data using the canonical individual ind? and the ontology; and retrieving an answer meeting all query conditions in a query from the original data and the converted explicit data. The computer-implemented system includes: a canonical individual generation unit; a data conversion engine; and a query unit.

Abstract: A process, system and computer software are provided to facilitate at least one recommendation to one or more users and/or one or more applications using multidimensional data. In particular, a multidimensional space is defined, wherein each dimension is capable of providing variable information. At least one dimension corresponds to user profiles. The multidimensional space is filled with multidimensional data corresponding to dimensions of the multidimensional space. Then, information from the multidimensional space is retrieved. Further, the recommendation is generated based on the retrieved information. In addition, it is possible to generate a recommendation-specific query. This can be performed by generating the recommendation-specific query to access a multidimensional cube and retrieve data stored therein. Then, the recommendation can be issued based on the data retrieved from the multidimensional cube.

Abstract: An arbitrary number of custom catalogs for an arbitrary number of customers can be published from a single database of seller catalog data. Custom browse hierarchies can be generated for each of the custom catalogs. The custom catalogs are subsets of the catalog database, and are generated in accordance with a set of rules that defines the scope of the content of the custom catalog. The rule sets define a series of sequential searches by which a subset of the product SKUs contained in the database are returned. A primary hierarchy is maintained that can have a scope coextensive with the primary database. Custom browse hierarchies can be pruned to render their scope approximately coextensive with each subset. The custom catalog subsets and the custom browse hierarchies are generated periodically through a virtual publication process.

Abstract: A method (and apparatus) for adapting an input parameter, for dynamically invoking target Web services, and for adapting output results, includes receiving an invocation request including an input parameter in a first format. A semantic information representation module MetaWSDL (Meta Web Service Description Language), wherein the MetaWSDL includes a universal XML (eXtended Markup Language) representation which includes semantic information of a Web service method signature, is retrieved from a memory. A MetaWSDL processor is invoked to adapt the input parameter to a second format using the retrieved MetaWSDL. The target Web services are dynamically invoked, using the adapted parameter in the second format, and the output result in the first format is adapted to the second format, using the MetaWSDL.

Abstract: Various techniques are disclosed to permit searching several locations with one query. Locations may include web search sites, subscription-only sites, line of business applications, or other searchable data repositories. The query may be modified to provide the required format or other information for each location to perform a search.

Abstract: A lexical mapper enables efficient text mining via use of lexical identifiers such as numerical identifier values. For example, the lexical mapper receives a collection of text-based strings associated with a document. Based on values of the strings, the lexical mapper maps the text-based strings to a set of lexical identifiers. In lieu of using the character strings, text mining applications process the numerical identifier values to analyze the document.

Abstract: Methods and systems for preparing data for searching and performing searches are provided. Searchable data definitions describe the location and format of searchable data within enterprise applications. Documents may be created from the searchable data definitions and indexed by a search engine, while preserving semantic information available within the enterprise application. Search results can include an indication of objects that are semantically related to each search result, providing more information and increased navigation and search options.

Abstract: The present invention extends to methods, systems, and computer program products for reducing persistence commands. An application host sends a persistence command to a persistence provider for processing. If the persistence provider recognizes and is able to carry out the persistence command, the persistence provider incorporates the semantics of the persistence command into the command implementation strategy; otherwise, the persistence provider employs a command reduction processor. The process of executing or reducing persistence commands is repeated until the persistence provider has produced and completed execution of a command implementation strategy equivalent to the original persistence command or until an unprocessable persistence command is reached for which no further reductions are possible. A command reduction processor can provide alternative persistence commands or an algorithm of persistence commands with semantics equivalent to an originally received persistence command.

Abstract: Embodiments of the invention provide techniques for temporarily disabling conditions in abstract queries. In one embodiment, a query interface is configured to present an abstract query, and to allow a user to select conditions of the abstract query to be temporarily disabled. By executing an abstract query having disabled conditions, the user may be able to determine the effect of individual changes to the abstract query without having to re-compose the abstract query after each change. The conditions to be disabled may be selected individually, by field, or by value. Each disabled element may be displayed with a visual indicator communicating that it is disabled. The user may then select specific disabled conditions to be re-enabled.

Abstract: An apparatus, method, and program product are provided for parsing a document. A match point tuple is passed to a parser instance. The match point tuple comprises a match point. The parser instance stream parses an XML stream. In response to a match point statement in the XML stream matching the match point expression in the match point tuple, the parser instance constructs a DOM instance comprising XML content matching the match point. In a sample embodiment, the match point tuple further comprises a filter, and the parser instance adds XML statements that pass the filter to the DOM instance and discards statements that do not pass the filter.

Abstract: An event is described herein as being representable by a quantified abstraction of the event. The event includes at least one predicate, and the at least one predicate has at least one constant symbol corresponding thereto. An instance of the constant symbol corresponding to the event is identified, and the instance of the constant symbol is replaced by a free variable to obtain an abstracted predicate. Thus, a quantified abstraction of the event is composed as a pair: the abstracted predicate and a mapping between the free variable and an instance of the constant symbol that corresponds to the predicate. A data mining algorithm is executed over abstracted, quantified events to ascertain a correlation between the event and another event.

Abstract: A method of creating and maintaining debug points in an integrated development environment (IDE) includes receiving a first query at a computing device coupled to the IDE, the first query identifying one or more actions; searching the source code with the computing device to locate locations where the one or more actions occur; forming an initial result set that includes locations of the one or more actions; receiving a desired behavior action for some or all of the locations; associating the initial result set and the desired behavior actions to form a first mapping; and storing the mapping and the first query as a first dynamic query based debug point map.

Abstract: Query expressions, such as LINQ (language integrated queries) queries, are enabled to be translated to URIs (uniform resource indicators) that may be used to query data sources at REST (representational state transfer) interfaces. A compiler is configured to convert a query into an expression tree. An expression tree normalizer is configured to normalize the expression tree into a normalized expression tree. A resource bound expression tree generator is configured to transform the normalized expression tree into a resource bound expression tree. A URI generator is configured to translate the resource bound expression tree into a URI.

Abstract: An information processing apparatus includes a controller that reads data by outputting, to a storage device having a data-recordable medium, a request for reading data recorded to the medium. Using file system management information corresponding to the data recorded to the medium, the controller generates, and outputs to the storage device, bit map data enabling the storage device to distinguish between the first cluster numbers where the starting data of read files are recorded, and the first cluster numbers where the starting data of non-read files are recorded.

Abstract: A method and system for integrating a physical query statement in a data abstraction model comprising a plurality of logical fields are provided. The method involves receiving the physical query statement and parsing the physical query statement to provide physical fields. The next step is determining whether the physical fields can be directly mapped to logical fields in the data abstraction model to yield a first determination result. Following this step, if at least one first physical field cannot be directly mapped to logical fields in the data abstraction model, then the next step is determining whether the first physical field can be determined from fields in the data abstraction model to yield a second determination result. Finally, the method involves providing a representation of the first determination result and a representation of the second determination result.

Abstract: Methods, systems, and articles of manufacture that may be used for identifying and indicating annotations made for a variety of different type (i.e., heterogeneous) data objects are provided. According to some embodiments, an annotation store may be queried to identify annotations for data objects in a current view of data. For certain identifiable portions of the view (e.g., a row in a relational view), a callable function may be created that returns a set of indicia maps indicating which objects in the portions are annotated. Bits in an indicia map may correspond to different objects (e.g., individual cells in a row or the row itself). Using these indicia maps, an indication of which data objects are annotated may be provided in the view, for example, by displaying annotation icons proximate annotated objects.

Abstract: Techniques are provided for accessing and storing files within a virtual folder. A virtual folder is a folder that is logically a part of a hierarchical folder structure of a file system repository, but the contents of the virtual folder are not physically stored in the file system repository. A client may issue, to an access mechanism, a request to perform a file operation on a file in a virtual folder. The access mechanism, which may be a database server or a component therein, may perform the file operation on the file in the virtual folder as if the file was stored in a particular folder within the hierarchical folder structure implemented by the file system repository. Advantageously, files may be physically stored outside of the file system repository, but still be a part of the hierarchical folder structure implemented by the file system repository.

Abstract: According to some embodiments, a programming language in an application server may access different database server implementations, wherein the programming language accesses content of database tables via work areas derived from the database tables. A database table may be mapped to a work area such that each column in the database table is mapped to a corresponding component of the work area (having a default component type based on the column type of the associated column). It may be determined that a particular column in the database table is to store large object data content, and a new mapping to a work area may be defined such that a particular column maps to a corresponding component having a component type other than the default component type.

Abstract: The present invention provides a method and system for providing targeted applications within a search engine results page. The method and system includes receiving a search query from a user and interpreting the search query. The method and system then first maps the interpreted query to one or more action templates, wherein mapping the interpreted query to one or more action templates comprises selecting one or more actions associated with the interpreted query. The method and system then maps the selected one or more actions associated with the interpreted query to a plurality of applications and selecting one or more applications associated with the one or more actions. Finally, the method and system displays the one or more applications within a search results page.

Abstract: Methods, systems, and computer program products for storing, managing, querying, and displaying data are described herein. The method operates by classifying and displaying received flow cytometry data. In an embodiment, the method creates a first extensible dimension table with columns that include keywords from received data. The method creates a second extensible dimension table with columns corresponding to parameters from the received data. The method then populates dimension tables with data describing values of dimensions of the classified data. The method populates a first fact table from the classified data. The method then populates a second fact table with a summary of data from the first fact table. The method displays a user interface on a display of a computer device. The method then permits a user to select query attributes including keywords and parameters. The method builds and executes queries based upon dimensions generated from grouped selected query attributes.

Abstract: A method, apparatus, and program for reorganizing a database while concurrently providing access to the database for updates. In an exemplary embodiment of the invention, an on-line reorganization facility (ORF) uses index data-spaces that point to other data-spaces, referred to as data data-spaces, to efficiently track and coordinate information about the data-elements in an original data-space operated upon by a reorganization process. A relative base address of a data-element in an index data-space can be derived from a relative base address of a data-element in an original data-space, and vice versa. An index data-space data-element contains a location of a data-element in a data data-space that tracks change information related to a corresponding data-element in the original data-space. Tracked changes are later applied to the newly reorganized data-space to assure consistency and integrity of the data.

Abstract: A computer implemented data processor system automatically disambiguates a contextual meaning of natural language symbols to enable precise meanings to be stored for later retrieval from a natural language database, so that natural language database design is automatic, to enable flexible and efficient natural language interfaces to computers, household appliances and hand-held devices.

Abstract: A program for reorganizing information in a computer system while concurrently providing access to the information for updates. In an exemplary embodiment of the invention, an on-line reorganization facility (ORF) uses index data-spaces that point to other data-spaces, referred to as data data-spaces, to efficiently track and coordinate information about the data-elements in an original data-space operated upon by a reorganization process. A relative base address of a data-element in an index data-space can be derived from a relative base address of a data-element in an original data-space, and vice versa. An index data-space data-element contains a location of a data-element in a data data-space that tracks change information related to a corresponding data-element in the original data-space. Tracked changes are later applied to the newly reorganized data-space to assure consistency and integrity of the data.

Abstract: Embodiments of the invention provide methods, systems, and articles of manufacture improving the process of query composition, query processing, and presenting query results to users of an abstract database. Embodiments of the present invention organize and view data using abstract records. Specifically, users compose a query according to the logical relationships present in the data. Rather than evaluate conditions against a set of rows from a relational table, conditions included in abstract query are evaluated against instances of an abstract record. Instances that satisfy the conditions specified by an abstract query are returned as query results. In a specific case abstract records are used to evaluate a “never exists conditions, that determine the absence of data in an abstract records that satisfy a particular condition.

Abstract: A mapping language, insertable into a DTD, allows automatic mapping from data sources into XML. A mapping results from the establishment of a correspondence between entities in a data source on the one hand and lists and scalars on the other hand. The language maps the lists and scalars to XML elements and attributes. The mapping language includes two constructs: the binding specification and the value specification. The value specification associates with a value or choice declaration. The binding specification includes at least one variable/expression pair. The constructs are insertable into a DTD to create an annotated DTD.

Abstract: An Internet infrastructure that supports searching of images by correlating a search image with that of plurality of images hosted in Internet based servers in selected categories, containing an image search server, and a web browser contained in a client device that supports displaying of the images. The image search server supports delivery of search result pages to a client device based upon a search string or search image, and contains images from a plurality of Internet based web hosting servers. The image search server also delivers characteristic analysis of an image to the client device upon request. The selection of images is done within selected categories and is based upon: (i) word match, that is, by selecting images, titles of which correspond to the search string; and (ii) image correlation, that is, by selecting images, image characteristics of which correlates to that of search image. The selection of images in the search result page also occurs on the basis of popularity.

Abstract: An Internet infrastructure that supports searching of images by correlating a search image with that of plurality of images hosted in Internet based servers, containing an image search server, and a web browser contained in a client device that supports displaying of the images. The image search server supports delivery of search result pages to a client device based upon a search string or search image, and contains images from a plurality of Internet based web hosting servers. The image search server delivers a search result page containing images upon receiving a search string and/or search image from the web browser. The selection of images in the search result page is based upon: (i) word match, that is, by selecting images, titles of which correspond to the search string; and (ii) image correlation, that is, by selecting images, image characteristics of which correlates to that of search image. The selection of images in the search result page also occurs on the basis of popularity.

Abstract: A method facilitating interoperability across the integrating platforms is provided by composing purpose specific integrating tools using conceptual modeling framework and a set of primitive foundational components. The model driven architecture provides easy migration from one solution architecture to another. Also, the present invention discloses a method to migrate from one implementation to another using set of composed purpose specific integration tools.

Abstract: A system, method and computer program product provides a solution to a class of categorization problems using a semi-supervised clustering approach, the method employing performing a Soft Seeded k-means algorithm, which makes effective use of the side information provided by seeds with a wide range of confidence levels, even when they do not provide complete coverage of the pre-defined categories. The semi-supervised clustering is achieved through the introductions of a seed re-assignment penalty measure and model selection measure.

Abstract: Provided are a method, system, and article of manufacture for using different groups of query graph transform modules to generate execution plans for queries for different database types. A plurality of first type query translator modules include information indicating a first data store type to which the first query translator modules apply and a plurality of second query translator modules include information indicating a second data store type to which the first query translator modules apply. A query is received to query a target data store. A determination is made as to whether the target data store is of the first data store type or the second data store type. The first query translator modules are used to translate the received query to a query execution plan in response to determining that the target data store is of the first data store type.

Abstract: The present invention provides a search apparatus, method and program using a public search engine, which is capable of acquiring necessary information without allowing confidential information to be inferred. Input of a desired search word comprising characters is received, and characters are extracted from the search word. Multiple character strings comprising the extracted characters are generated. A word is selected as a noise word, and characters are selected from the noise word. A noise character string comprising the extracted characters is generated. A query is generated by combining the character strings and noise character strings, and is transmitted to the search engine. A search is performed by use of the search word over a search result transmitted from the search engine in reply to the query, and the search result is displayed.

Abstract: A stream of data can be estimated by a model to produce an estimated equation. The estimated equation can be used to calibrate a response to a SQL type join query.