Query History Research Articles

Diagnostic and therapeutic procedure for spontaneous emphysema of the neck and mediastinum

Emphysema without any etiological indices from the history represents a diagnostic and therapeutic challenge. PATIENT COLLECTIVE: Over the last 5 years, we treated four patients (three male, one female; aged 3-29 years) with cervical and/or mediastinal emphysema of unknown cause. Two young men with cervical emphysema were observed and received prophylactic antibiotic treatment. After involution of the emphysema, we performed an endoscopy which revealed no abnormalities. A female patient and a 3-year-old boy had a history of coughing and a query history of foreign body ingestion before the appearance of the emphysema. The immediate endoscopies were without pathologic findings. All patients recovered completely without any complications or recurrences. If there is no indication for a foreign body or a trauma in the history or in radiological imaging, endoscopy of the airways and the upper digestive tract should follow when the emphysema has subsided. The aim is to avoid any further spread of the emphysema and of pathogens. If there is a history of a foreign body or trauma, an immediate endoscopy is indicated.

Data warehouse screening and personalizing agent

Intelligent software agents have been developed for many purposes these days. Software agents have been developed in many types of applications such as Internet search engines etc. This article is all about implementing the intelligent software agent in a data warehouse implementation. The first purpose of this software agent is to screen data in order to avoid data duplication in the data warehouse. The second objective of this research is to personalize the user requirements of data marts in data warehouse environment. The software agent consists of two basic modules. The first module is the information screening module. This module is implemented as an addition to the data staging process, before the data is loaded into the data warehouse. It functions as a pre-loading step, where the data to be loaded into the data warehouse has been cleaned, extracted and transformed. This module uses an enhanced Fuzzy String Matching to check the existence of data in the data warehouse. The second module involved is the personalization module. This is a module where the agent will study the history queries sent by users to the system. The queries may represent user requirements to find any pattern of time of the queries being sent to the system. The technique used by the agent to study users’ queries is grouping the queries which are similar to each other. The largest group of queries is considered as the most needed query. However, this agent may be enhanced to produce a more robust intelligent agent.

대체에너지원 이력 데이터 관리 시스템 설계

Recently, the renewable energy resources play an important role as an energy resources of future due to an environmental pollution and lack of resources and so on. The development and diffusion of information systems related to renewable energy resources have been driven actively abroad. However, at domestic an efficient history management for renewable energy resource data and web retrieve service are not provided. Therefore, in this paper, we propose a history data management system for the renewable energy resources, which stores and manages vast history information of renewable energy resource data systematically. This system collects renewable energy resource data in the outside observation system and stores them in the history database. The stored Information is retrieved through the history query process and can be provided in various forms - table, graph, chart and counter line, etc. - on the internet. Especially, the proposed system manages the history data in real-time so the latest information is always provided to the users through the web interface.

Index Navigator: Search Engine with Reasoning for Understanding and Expressing User's Changing Mind

When a search engine user becomes interested in a new area for him/herself, it is difficult for the user to enter a query precisely expressing the interest or to select areas including the interest, because he/she is just a beginner of the interest. This paper presents a system called Index Navigator, which tells areas a user is interested in, keywords he/she should enter as a query, and documents concerning his/her interest. A tough problem for such a system is to understand the user's interest from the query he/she entered. Index Navigator employs an inference method called Cost-based Cooperation of Multi-Abducers (CCMA), for understanding a user's interest from the history of the user's queries (expression of interest in i>incomplete keywords), even if the changing speed of the user's interest can not be estimated. With this device, Index Navigator guided the user to areas, keywords and documents relevant to his/her interest, according to the experimental results.

Active Replication and Update of Content in Electronic Commerce

:This paper describes a strategy for actively replicating and updating content for electronic commerce. Active replication and updating of content is achieved by intelligent agents (IA) using a time-invariant fragmentation approach to partitioning and replicating data in a distributed computing environment. Taking into account the time-sensitivity property of data, lAs derive time-invariant fragments for their respective nodes from the query history. A time-invariant fragment (TIF) is that portion of the database whose values do not change during a specified time interval. The algorithm that IAs use in creating TI Fs for each node, for a given time interval, is presented. The active replication approach is compared with three other approaches, full-replication, non replication, and materialized view, in terms of data transmission costs. Results indicate that the active approach can be most effective for electronic commerce because of the high percentage of modification queries, the large size of the network, and the great number of transactions.

An efficient multiversion access structure

An efficient multiversion access structure for a transaction-time database is presented. Our method requires optimal storage and query times for several important queries and logarithmic update times. Three version operations-inserts, updates, and deletes-are allowed on the current database, while queries are allowed on any version, present or past. The following query operations are performed in optimal query time: key range search, key history search, and time range view. The key-range query retrieves all records having keys in a specified key range at a specified time; the key history query retrieves all records with a given key in a specified time range; and the time range view query retrieves all records that were current during a specified time interval. Special cases of these queries include the key search query, which retrieves a particular version of a record, and the snapshot query which reconstructs the database at some past time. To the best of our knowledge no previous multiversion access structure simultaneously supports all these query and version operations within these time and space bounds. The bounds on query operations are worst case per operation, while those for storage space and version operations are (worst-case) amortized over a sequence of version operations. Simulation results show that good storage utilization and query performance is obtained.

A new probabilistic scheme for information retrieval in hypertext

Abstract The aim of probabilistic models is to define a retrieval strategy within which documents can be optimally ranked according to their relevance probability, with respect to a given request. In this scheme, the underlying probabilities are estimated according to a history of past queries along with their relevance judgments. Having evolved over the last twenty years, these estimations allow us to take both document frequency and within-document frequency into account. In the current study, we suggest representing documents not only by index term vectors as proposed by previous probabilistic models but also by considering relevance hypertext links. These relationships, which provide additional evidence on document content, are established according to requests and relevance judgments, and may improve the ranking of the retrieved records, in a sequence most likely to fulfill user intent. Thus, to enhance retrieval effectiveness, our learning retrieval scheme should modify: (1) the weight assigned to e...

Scheduling the allocation of data fragments in a distributed database environment: a machine learning approach

Different database fragmentation and allocation strategies have been proposed to partially replicate data in a partitioned, distributed database (DDB) environment. The replication strategies include database snapshots, materialized views, and quasi-copies. These strategies are 'static' and do not adapt to the changes in the data usage patterns. Furthermore, they often require expensive update synchronizations to maintain data consistency and do not exploit the knowledge embedded in the query history. This paper describes a machine learning based time invariant fragmentation method (MLTIF) that acquires knowledge about the data usage patterns for each node. Based on this knowledge, MLTIF designs time invariant fragments and schedules its allocation and selective update for a specified time period. Simulation is used to compare the effectiveness of the MLTIF approach with that of full replication, materialized views, and nonreplication strategies. Initial results indicate that for most normal operating conditions, the MLTIF approach can be effective.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>