Abstract: A technique for preventing modification of productive data in a database. In response to a database access request in a productive data database access configuration, a database interface facilitates access to a sample database when a sample switch is enabled. The database interface facilitates normal database access when the sample switch is disabled.

Abstract: Techniques are provided for generating descriptions of matching resources in a manner that takes into account the kind, quality, and relevance of the available sources of information about the matching resources. For example, after the search engine identifies matching resources based on the query terms, the search engine determines the kinds of available sources of information about each matching resource. For each matching resource, based on the kinds of available sources of information about the matching resource, one of a plurality of processes is selected to generate a description for the matching resource. Using the content-sensitive description generation techniques described herein, a single result set may include abstracts that were generated using several different processes, where the difference in process corresponds to a difference in the kind, quality, and relevance of the available sources of information about each matching resource.

Abstract: A concept network that can be generated in response to a user query. In one embodiment, the concept network is being used with a search tool. The search tool searches a plurality of data storage locations. Each data storage location is arranged with a node. Certain ones of the nodes are connected by at least one link. The concept network selects a portion of certain ones of the nodes based on the link, wherein the at least one link is used for content purposes.

Abstract: A technique for ranking records of a database is disclosed. In one particular exemplary embodiment, the technique may be realized as a method for ranking records of a database located during a search of an index to the database performed in response to a query, wherein the index has a plurality of index entries, and wherein each index entry has a weight.

Abstract: In certain embodiments, a database system for processing a query request comprises at least one master node operable to communicate a request over a communication channel, the request comprising a request to perform an activity associated with a precompiled query. The system further includes a first slave node and a second slave node each coupled to the at least one master node, each of the first and second slave nodes operable to receive the request on the communication channel. The first slave node is further operable to communicate a first notification over the communication channel indicating that the first slave node is handling the request, and the second slave node is operable to receive the first notification communicated over the communication channel indicating that the first slave node is handling the request.

Abstract: A query difficulty prediction unit includes a query difficulty predictor to determine the extent of overlap between query documents received from a search engine operating on an input query and sub-query documents received from the search engine operating on sub-queries of the input query. The unit generates a query difficulty prediction from the extent of overlap.

Abstract: Disclosed are a method, a system and a computer program for scrolling to an arbitrary position in a set of unfetched rows of data in a relational database. Each of the rows has a plurality of columns and a class value in each of the columns. Also, each column of the set of rows of data has class values for a specified data class, and the rows are ordered according to a given sequence of these classes. The method of this invention, preferably, comprises the steps of identifying one of the rows in the database, and finding that one of the rows by identifying the given sequence of data classes by which the rows are ordered, and for each of the data classes in the given sequence, determining the class value for the data class in the identified one of the rows.

Abstract: Methods and systems are presented for custom caching. Application threads define caches. The caches may be accessed through multiple index keys, which are mapped to multiple application thread-defined keys. Methods provide for the each index key and each application thread-defined key to be symmetrical. The index keys are used for loading data from one or more data sources into the cache stores on behalf of the application threads. Application threads access the data from the cache store by providing references to the caches and the application-supplied keys. Some data associated with some caches may be shared from the cache store by multiple application threads. Additionally, some caches are exclusively accessed by specific application threads.

Abstract: The likely relevance of each term of a search-engine query of two or more terms is determined by their deletion probability scores. If the deletion probability scores are significantly different, the deletion probability score can be used to return targeted ads related to the more relevant term or terms along with the search results. Deletion probability scores are determined by first gathering historical records of search queries of two or more terms in which a subsequent query was submitted by the same user after one or more of the terms had been deleted. The deletion probability score for a particular term of a search query is calculated as the ratio of the number of times that particular term was itself deleted prior to a subsequent search by the same user divided by the number of times there were subsequent search queries by the same user in which any term or terms including that given term was deleted by the same user prior to the subsequent search. Terms are not limited to individual alphabetic words.

Abstract: A method of providing relevant search information comprises receiving a search term. The method also comprises locating a first search result that matches the search term, wherein the first search result is associated with a first measure of reputation, locating a second search result that matches the search term, wherein the second search result is associated with a second measure of reputation, and preferentially presenting the first and the second search results based on the first and the second measures of reputation.

Abstract: A management system for a transportation carrier such as an airline is described that provides network-based management of customer data by allowing a user to form a list comprising multiple customers associated with different sets of criteria and to process customer data corresponding to customers associated with multiple lists defined by different criteria. In one embodiment, an airline management system allows a user to append additional customers to a list comprising previously selected customers without having to re-request the list with additional search criteria and re-select the previously selected customers. The airline management system also allows a user to simultaneously display multiple lists of customers that are defined by different criteria. As a result, airline personnel using the airline management system may more effectively and efficiently access and manage customer data required to provide airline services.

Abstract: A computer implemented system that facilitates view matching for outer join views comprises an interface component that receives at least one query that includes one or more outer join operators. A view matching-component converts the at least one query and outputs a substitute query expression. In accordance with one aspect of the subject invention, the view-matching component can comprise a normalization component that converts the at least one query and at least one materialized view into a normalized query expression and a normalized view expression. Furthermore, the view-matching component can include an analysis component that receives the normalized query expression and the normalized view expression, and a construction component that constructs the substitute query expression.

Abstract: Described herein are instance mapping techniques that facilitate the rewrite of queries to access materialized views that have multiple instances of the same table. Instance mapping techniques are processes for determining a mapping between equivalent instances in a query and materialized view definition. An instance in a query that is equivalent to an instance in a materialized view definition (or another query) is treated as if they are identical labels for the same table for the purposes of rewriting a query. To determine the mapping between instances of a table in a query and a materialized view definition, join predicates in the query and materialized view definition that involve instances of the table are compared.

Abstract: An embodiment of a system, method and apparatus is disclosed. The system comprises a first processor that is in communication with a root existence table. The first processor is to check the root existence table to determine if a character is a root character. A second processor is in communication with a root active list. The second processor is to retrieve an entry that corresponds to the character and to associate a pointer with the entry. A third processor is in communication with the second processor and a tree structure. The third processor is to receive the pointer from the second processor and to maintain the tree and table structure.

Abstract: Methods and architectures for implementing a scalable multi-database event processing system are provided. In one embodiment, selected account data is aggregated for all subscribers (aggregated subscriber-specific data) and a copy included on each database. In one embodiment, selected data that is not subscriber specific and that may apply to many accounts (“global data”) is also maintained and copied to each database. The global data preferably includes business data that is frequently required during operation of the system, such as pricing data. A transaction that requires business data and access to an account is processed using the copy of the business data that is on the database on which the account is located. In an embodiment, the aggregated subscriber-specific data is used in performing searches.

Abstract: An integrated import/export system includes a database of records relating to a plurality of shipments of goods, a database server and an application server. The application server communicates with the database server to provide members of a supply chain for a shipment of goods an opportunity to modify records relating to the shipment. As the shipment moves through the supply chain, the records relating to the shipment may be repeatedly updated and accessed by interested parties such as customs brokers and government officials. A central repository for such data minimizes errors from repetitive data entry and provides a more complete source of information relating to the shipment than is typically associated with a shipment at any time in transit.

Abstract: A distributed file system is disclosed. A plurality of disk servers, operating as a single distributed disk server layer, are connected to the one or more physical disks. Each disk server stores meta-data for each of the files. A plurality of lock servers, having one or more locks for each file operates as a single distributed lock server to coordinate access to the files stored by the disk server layer. A plurality of asynchronous file servers, operating as a single distributed file server layer in response to a request for a file from a user program: (i) retrieves the requested file from the disk server layer and at least one lock, associated with the retrieved file, from the lock server, and (ii) retrieves meta-data for at least one file that is related to the requested files, and at least one lock, for each file that has had its meta-data retrieved.

Abstract: Provided is a method, system, and program for providing an object discovery agent (ODA) client. There is one object discovery agent (ODA) client and at least one ODA, wherein each ODA is associated with one application and includes: (i) application programming interfaces (APIs) to communicate with the associated application to discover definition information on objects maintained by the application and (ii) code to communicate with the ODA client. The ODA client communicates with one of the at least one ODA to cause the ODA to gather definition information on at least one object used by one application. The gathered object definition information is provided to an integration server to integrate the object in an environment including heterogeneous objects from different applications.

Abstract: A modeling tool for building a model of a problem involves a plurality of variables, whereby a heuristic search method can be carried out to optimize a solution for the modeled problem. The model of a problem includes a plurality of expressions defined as corresponding to one or more declarative statements and at least some of the expressions are dependent on at least one of the variables. The problem modeling tool can include automatically updating each declarative statement in response to changes to each variable associated therewith.

Abstract: An implementation repeatedly updates data in a data structure, the data structure having a size larger than an atomic size. The implementation avoids locking the data structure on every update, however. One method accesses data in a first portion of a data structure and estimates, based on the accessed data, an impact on data in a second portion of the data structure arising from an update to data in the first portion. The method then determines, based on the estimated impact, whether to lock the data structure during an update to data in the data structure. In a more particular example, a counter is copied on a regular basis. If only the least significant bits of the counter have changed, then an atomic instruction is used to copy only the least significant bits. However, when the more significant bits have changed, a lock is used to copy the entire counter.

Abstract: A database system with methodology for automated determination and selection of optimal indexes is described. In one embodiment, for example, in a database system, a method of the present invention is described for recommending database indexes to be created for optimizing system performance, the method comprises steps of: capturing a workload representative of database queries employed during system use; creating virtual indexes for optimizing system performance during execution of the database queries captured in the workload; computing cost benefits for different combinations of the virtual indexes; and recommending physical indexes to be created based on virtual indexes that have favorable cost benefits for the captured workload.

Abstract: A database server registers an XML schema and determines a database representation for the XML schema and mapping information, determining what database types should be used to represent an XML schema and/or how instances of the XML schema are stored by a database system. The mapping information indicates the mapping between the constructs declared in the XML schema and the constructs included in the appropriate database representation. The XML schema may contain annotations that describe one or more properties of a database representation of an XML date-time type. Based on the annotations, the database determines an appropriate database representation and generates mapping information mapping the declaration of the XML date-time type of the XML schema to the constructs of the database representation.

Abstract: A set similarity join system and method are provided. The system can be employed to facilitate data cleaning based on similarities through the identification of “close” tuples (e.g., records and/or rows). “Closeness” can be is evaluated using a similarity function(s) chosen to suit the domain and/or application. Thus, the system facilitates generic domain-independent data cleansing. The system can be employed with a foundational primitive, the set similarity join (SSJoin) operator, which can be used as a building block to implement a broad variety of notions of similarity (e.g., edit similarity, Jaccard similarity, generalized edit similarity, hamming distance, soundex, etc.) as well as similarity based on co-occurrences. The SSJoin operator can exploit the observation that set overlap can be used effectively to support a variety of similarity functions. The SSJoin operator compares values based on “sets” associated with (or explicitly constructed for) each one of them.

Abstract: A system and method of registering voters and tabulating an election is provided. A voter database is maintained with a record of each eligible voter comprising at least one voter characteristic. Based on the at least one voter characteristic, a set of positions and issues for which the voter is eligible to vote is determined. The set of positions and issues is printed onto a ballot. The ballot may be printed on demand or mailed to the voter along with a return envelope and an anonymous ballot envelope. A system and method for tabulating and auditing election results is also provided. Voted ballots are scanned and computer readable visual representations of the ballots are generated and stored. The visual representations are analyzed to generate vote data. The visual representation, vote data and ballot are associated with each other by a unique ballot identification. Visual representations of ballots can be retrieved based on a database query and displayed along with the associated vote data for review.

Abstract: Direct memory accessed is used to perform database operations between two or more machines. A first segment of memory is allocated for a second machine, where at least one of the first machine and second machine is a database server. During performance of a database operation that involves the transfer of data from the second machine to the first machine, data in the first segment of memory is buffered in response to the second machine writing the data to a second segment of memory on the second machine.

Abstract: A reporting program and system for updating a master copy of a geographic database is disclosed. According to the method and system, reports are obtained that relate to data contained in a geographic database. Satellite images of the geographic locations represented by the data in the reports are obtained. The satellite images are analyzed to confirm a need to make changes to the master copy of the geographic database based on the reports. After confirming the need to make the changes, the master copy of the geographic database is updated.

Abstract: For a software component to be installed on a target computer system a product dependency graph is determined which identifies additional software components required by the to-be-installed software component as prerequisite or corequisite software components. For each of these software components a corresponding installation facility is determined. Then a process model is generated being executable by a Workflow Management System (WFMS). The WFMS process model comprises a directed graph of activities, wherein each software component of the product dependency graph is associated with an activity such that when the activity is executed the installation facility corresponding to each of the software components is performed. Moreover, the WFMS process model is generated in a way that the sequence of activities in the directed graph is not violating the dependencies of the software components in the product dependency graph. Finally the WFMS process model is inserted in the WFMS as the provisioning process.

Abstract: A file system (i) permits storage capacity to be added easily, (ii) can be expanded beyond a given unit, (iii) is easy to administer and manage, (iv) permits data sharing, and (v) is able to perform effectively with very large storage capacity and client loads. State information from a newly added unit is communicated (e.g., automatically and transparently) to central administration and management operations. Configuration and control information from such operations is communicated (e.g., automatically) back down to the newly added units, as well as existing units. In this way, a file system can span both local storage devices (like disk drives) and networked computational devices transparently to clients. Such state and configuration and control information can include globally managed segments as the building blocks of the file system, and a fixed mapping of globally unique file identifiers (e.g., Inode numbers) and/or ranges thereof, to such segments.

Abstract: A system for data base management using memory devices holding a database containing tables of data occupying extents. A database engine reviews each query to determine an extents list of extents containing the data needed by that said query. A query monitor then re-orders the extents lists so that extents are retrieved and stored in a buffer cache for more efficient use when executing the queries. The database engine retrieves needed extents from the memory devices, as ordered in the extents lists, and stores those extents in the buffer cache. The database engine then executes one or more queries on the data in the extents in the buffer cache to determine respective results.

Abstract: Techniques are provided for replicating data on computer systems, including database systems. The operations of a group of transactions are rearranged to be executed in another set of transactions. A transaction in the other set of transactions may be executed independently of the timing of the execution of any other transaction from the set, so long as the set is committed as a group.

Abstract: Disclosed is a method and system for performing periodic replication using a write-ordered log. According to one embodiment, a plurality of write operations to a primary data volume are tracked using a write operation log and then data associated with the plurality of write operations is replicated to a secondary data volume by coalescing the plurality of write operations utilizing the write operation log and transferring data associated with the plurality of write operations to the secondary data volume. According to another embodiment the described tracking includes storing metadata associated with the plurality of write operations within the write operation log. In another embodiment, the described coalescing includes identifying a non-overlapping portion of a first write operation and a second write operation of the plurality of write operations utilizing the metadata.

Abstract: A method and system where data is maintained in a continuous data protection system is disclosed. A primary volume may be protected according to an any-point-in-time (APIT) window wherein restores may be performed at any time as desired. The APIT window may be of any time duration as desired. Outside of the APIT window, a retention policy for phasing out data may be established as desired.

Abstract: An apparatus for synchronizing data between DBMSs has a first DBMS and a second DBMS. The second DBMS has a storage for persistently storing data items in a form of a storage structure, i.e. database. The second DBMS has also a second data storage for persistently storing data in a form of a sequential order, i.e. a transaction log. The data to be synchronized from the first DBMS to the second DBMS is analysed and based on the analyzing, it is decided how to persistently store the data between the first and the second data storage in the second DBMS. There can be decided how to store the data between the first and the second data storage. The characteristics of the data to be stored may influence on the storage between the first and the second data storage. Thus, the storage depends on the actual data to be stored.

Abstract: Areas are hierarchically ensured as directories for data to be recorded in advance. Therefore directories and files are continuously arranged as much as possible on a disk, and the number of seeks during data read, which is conventionally large because other data is mixed in the same area, is decreased as few as possible. When the files and directories belonging to directory 1 (DIR1) and directory 2 (DIR2) are recorded on a disk and when the files and directories belonging to directory 1 (DIR1) are recorded in an area-ensuring mode, an area on a disk for the files and directories belonging to the directory 1 (DIR1) is ensured previously. The positions where lower-order Files 1, 2 and directories of the directory 1 (DIR1) are recorded in an area concerning the directory 1 (DIR1) as in the case of File 1-1, File 1-2, and File 12. File 3 of the directory 2 (DIR2) is not recorded in continuous areas for the directory 1 (DIR1).

Abstract: A digital filter combination for interpolating primary sample values of a sampled signal using an mth-order discrete-time filter and a kth-order continuous time interpolation filter, with m?3 and k?2, wherein the discrete-time filter forms n secondary sample values from at least m+1 primary sample values at equal time intervals, with n?m, and the continuous-time interpolation filter forms from at least part of the n secondary sample values an interpolated value whose temporal position with respect to that of the primary sample values is predeterminable by a normalized interpolating instant dp=tin/T, where tin is the absolute interpolating instant, and T is the period of the primary sampling rate.

Abstract: An up-sampled half band reconstruction filter has a seagull architecture in the form of a pair of parallel infinite impulse response (IIR) filters, one receiving as an input an input signal delayed by one sample time and the other receiving as an input a reverse version of the input signal delayed by one sample time. The outputs from the pair of parallel IIR filters are combined with the input signal to produce a reconstruction filter output in response to the input signal.

Abstract: An efficient method of generating a bit-reverse index array in real time without performing any bit manipulation for a wireless communication system.

Abstract: A digital adder circuit comprising a plurality of logical stages in the carry logic of said adder circuit, for generating and propagating predetermined groups of operand bits, each stage implementing a predetermined logic function and processing input variables from a preceding stage and outputting result values to a succeeding stage with static and dynamic logic in the carry network of a 4-bit adder, and with output from the first stage fed directly as an input (60, 62) to the third stage of the carry network. Preferably, stages having normally relatively high switching activities are implemented in static logic. Preferably, the first stage of its carry network is implemented in a static logic, and the rest of the stages in dynamic logic.

Abstract: A method of utilizing transport protocols to provide bidirectional web procedure calls is disclosed. A callback request included with a web procedure call provides a destination address and port on the requesting device to be utilized in a new connection for receiving the response from the receiving device. The utilization of a callback request included with a web procedure call enables a receiving device to terminate the original connection upon which it received the web procedure call while performing the requested procedure. In situations where the requested procedure takes an extended period of time or the receiving device is responding to a large number of requests, the ability to drop the original connection, perform the procedure, and respond to the requesting device via a new connection saves resources on the receiving device. Replies to the request are sent to the requesting device utilizing the destination address and port included as a parameter in the callback request.

Abstract: A proxy apparatus and method for streaming media information via at least one network and for building-up a good quality version of the media information. When a user device communicates with the proxy apparatus using a particular bandwidth and requests that media information be provided from a media server, the proxy apparatus first determines if a version of the media information encoded for the user device's connection bandwidth has been stored in the proxy apparatus. If a version of the media information encoded for the user device's bandwidth is not available from the proxy apparatus, the proxy apparatus sends a request to a media server for the media information. Once the media server receives the request, the media server begins to stream a copy of the media information encoded for the user device's bandwidth to the user device via the network and proxy device.

Abstract: A method for displaying information includes identifying computer-readable service code at a service site, which code, when read by a client computer via a network, causes the computer to display at least one service page containing service information. Some service code is selected for inclusion in a service component containing at least some service information that corresponds to the selected code. A pointer is generated, indicating a location at which the service component is accessible to a remotely located client computer via the network, allowing the client computer to display a host page containing host information. An invocation of the pointer by the client computer is received at the location when the client computer accesses the host page. The selected service code is then conveyed to the client computer, such that responsive to the selected service code, the client computer displays the service component on the host page.

Abstract: The present invention provides for facilitating synchronization in a data source/data destination environment using data replicas. When a plurality of destinations request synchronization with a source, a first destination selected for synchronization is processed such that differences between the first destination data and source data is determined and persisted in a partition update. After updating the first destination, the synchronization process continues only for those remaining destinations that will be affected by the partition change, as determined by the persisted data, and then as updated by the persisted data.

Abstract: A virtual workspace is provided for a user with a number of electronic devices, in which information can be exchanged among the electronic devices through a number of connections between the electronic devices. The virtual workspace is provided by determining where services are located and the type of the services, determining one or more data formats associated with data accessible by one or more of the electronic devices. A portion of the data has a given one of one or more data formats. An electronic device is selected based at least in part on predetermined criteria and the given data format. A route through the connections to the selected electronic device is determined, where the route may comprise a given one or more of the connections. At least the portion of the data associated with the given data format is routed to the selected electronic device. The portion of the data is utilizable for presentation by the selected electronic device when received by the selected electronic device.

Abstract: Systems and methods allowing an instant messaging user to exchange messages with an e-mail user. To the instant messaging user, the experience is a seamless exchange of instant messages; to the e-mail user, the experience is a seamless exchange of e-mail messages. Conversion of an instant message to an e-mail message includes insertion of a token into the e-mail message, and conversion of an e-mail message to an instant message includes validating a token extracted from the e-mail message.

Abstract: A system and method are disclosed for classifying a message. The method includes receiving the message, identifying all items of a certain type in the message, determining whether each of the items meets a criterion, and in the event that all the items are determined to meet the criterion, determining a classification of the message. The system includes an interface configured to receive the message, a processor coupled to the interface, configured to identify all items of a certain type in the message; determine whether each of the items meets a criterion; and in the event that all the items are determined to meet the criterion, determine a classification of the message.

Abstract: User IDs in addresses to which an e-mail is addressed are logically ordered into a 2D matrix of rows each having one user ID. For each column in the 2D matrix, a column count is found by counting the highest number of matching characters in the column. A column quotient is calculated for each column by dividing the column count by the total number of rows in the 2D matrix. A weighted column quotient is calculated for each column by multiplying the column quotient by a weight that is based on the left-to-right order of the column in the 2D matrix. A numerical assessment is made of the similarity of the user IDs in the addresses to which the e-mail is addressed by adding up the weighted column quotients for the columns in the 2D matrix.

Abstract: An intelligent email detection and auto reply email tool is disclosed. A method includes receiving an incoming email, determining whether the incoming email requires a response; and after determining that the incoming email requires a response, generating an auto reply email to the incoming email, wherein the incoming email is processed to determine characteristics of the auto reply email. Email sent to customers can have a no-reply origination address and control identifiers that then are recognized on incoming replies. The control identifiers can include such information as application information that identifies an application that generated the email (billing, marketing, order confirmation), region information, and an auto reply email count. The auto reply email can be associated with a web-based customer feedback tool including, for example, a dynamic web page that directly intelligently interlinks the customer to a web based email feedback system.

Abstract: A method, system, and program for managing on-demand email storage are provided. An email service provider allocates a predetermined amount of storage space to an intended recipient. When an email is received for the intended recipient at the email service provider, the email service provider determines whether the predetermined storage space has sufficient capacity for storage of the email. If the predetermined storage space is insufficient for storage of the email, then the email service provider allocates on-demand storage space to the intended recipient. The email service provider then stores the email in the on-demand storage space, such that the email is stored, rather than discarded, when the predetermined storage space reaches full capacity. Before allocating on-demand storage space, the email service provider may compare the email characteristics with predefined criteria set by the intended recipient for emails to be stored in on-demand storage space.

Abstract: An apparatus for classifying digital communications includes an interface module, an identification module, and a notification module. The interface module enables a recipient to perceive information relating to one or more digital communications received by the recipient. The identification module enables a first interface element capable of enabling the recipient to classify the digital communications among at least one category. The notification module notifies a network server of a classification received from the recipient using the first interface element.

Abstract: Alerts (13) are generated at mobile entity devices (12) and servers (16). The alerts are examined at the servers and handled by the server and/or forwarded to a clearing house (22). At the clearing house, emergency events (40) are created in response to the alerts by an event module (36). A notify module (38) compares events to an information need (304) associated with a subscriber profile (46) to determine whether a subscriber associated with the subscriber profile should be notified about events. The notify module also handles interactive search requests from a client (20) for the events.