By Topic

Proceedings International Database Engineering and Applications Symposium

17-19 July 2002

Filter Results

Displaying Results 1 - 25 of 30
  • Proceedings International Database Engineering and Applications Symposium

    Publication Year: 2002
    Request permission for commercial reuse | PDF file iconPDF (500 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2002, Page(s): 295
    Request permission for commercial reuse | PDF file iconPDF (193 KB)
    Freely Available from IEEE
  • A multi-agent model for handling e-commerce activities

    Publication Year: 2002, Page(s):202 - 211
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB) | HTML iconHTML

    In this paper we propose a multi-agent model for handling e-commerce activities. In our model, an agent is present in each e-commerce site, managing the information stored therein. In addition, another agent is associated with each customer handling her/his profile. The proposed model is based on the exploitation of a particular conceptual model, called the B-SDR network, capable of representing a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing federated database systems by compiling SchemaSQL

    Publication Year: 2002, Page(s):192 - 201
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB) | HTML iconHTML

    Federated systems integrating data from multiple sources must cope with semantic heterogeneity by reasoning over both the data and meta-data of their sources. SchemaSQL is one of a number of related higher-order languages, which have been proposed for succinctly expressing integrated views over heterogeneous sources. We define a method for compiling SchemaSQL into standard SQL. We show that the ou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable QoS-aware disk-scheduling

    Publication Year: 2002, Page(s):256 - 265
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (439 KB) | HTML iconHTML

    A new quality of service (QoS) aware disk scheduling algorithm is presented. It is applicable in environments where data requests arrive with different QoS requirements such as real-time deadline, and user priority. Previous work on disk scheduling has focused on optimizing the seek times and/or meeting the real-time deadlines. A unified framework for QoS disk scheduling is presented that scales w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Authorization model for summary schemas model

    Publication Year: 2002, Page(s):182 - 191
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (297 KB) | HTML iconHTML

    Security issues in multidatabases are complicated due to autonomy and heterogeneity of local databases. Deriving global authorizations by integrating underlying local authorizations is difficult since subjects and objects at each local database may not be compatible. In addition, local authorizations may conflict and could not be combined to form common global authorizations. This paper proposes a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast filter-and-refine algorithms for subsequence selection

    Publication Year: 2002, Page(s):243 - 254
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (505 KB)

    Large sequence databases, such as protein, DNA and gene sequences in biology, are becoming increasingly common. An important operation on a sequence database is approximate subsequence matching, where all subsequences that are within some distance from a given query string are retrieved. This paper proposes a filter-and-refine algorithm that enables efficient approximate subsequence matching in la... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • YAM2 (yet another multidimensional model): an extension of UML

    Publication Year: 2002, Page(s):172 - 181
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (363 KB) | HTML iconHTML

    This paper presents a multidimensional conceptual object-oriented model, its structures, integrity constraints and query operations. It has been developed as an extension of UML core metaclasses to facilitate its usage, as well as to avoid the introduction of completely new concepts. YAM2 allows the representation of several semantically related star schemas, as well as summarizability ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Yet another query algebra for XML data

    Publication Year: 2002, Page(s):106 - 115
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (347 KB)

    XML has reached a widespread diffusion as a language for representing nearly any kind of data source, from relational databases to digital movies. Due to the growing interest toward XML, many tools for storing, processing, and querying XML data have appeared in the last two years. Three main problems affect XML query processing: path expression evaluation, nested query resolution, and preservation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DWS-AQA: a cost effective approach for very large data warehouses

    Publication Year: 2002, Page(s):233 - 242
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (351 KB) | HTML iconHTML

    Data warehousing applications typically involve massive amounts of data that push database management technology to the limit. A scalable architecture is crucial, not only to handle very large amount of data but also to assure interactive response time to the users. Large data warehouses require a very expensive setup, typically based on high-end servers or high-performance clusters. In this paper... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph partition based multi-way spatial joins

    Publication Year: 2002, Page(s):23 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (474 KB) | HTML iconHTML

    We investigate the problem of efficiently computing a multi-way spatial join without spatial indexes. We propose a novel and effective filtering algorithm based on a two phase partitioning technique. To avoid missing hits due to an inherent difficulty in multi-way spatial joins, we propose to firstly partition a join graph into sub-graphs whenever necessary. In the second phase, we partition the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating HTML tables using semantic hierarchies and meta-data sets

    Publication Year: 2002, Page(s):160 - 169
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (901 KB) | HTML iconHTML

    As the Internet is a global network, there is a demand on accessing closely related data without browsing through different Web documents. A significant amount of these data are presented in HTML documents. Since data contents of HTML documents are intervened by markups, it is not trivial to integrate and provide a unified view of closely related data in different HTML documents. In this paper we ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel processing XML documents

    Publication Year: 2002, Page(s):96 - 105
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (271 KB) | HTML iconHTML

    As Web applications are time vulnerable, the increasing size of XML documents and the complexity of evaluating XML queries pose new performance challenges to existing information retrieval technologies. This paper introduces a new approach for developing a purpose-built XML data management system to improve the system performance of a Web site with XML support by using parallel data processing tec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clustering spatial data in the presence of obstacles: a density-based approach

    Publication Year: 2002, Page(s):214 - 223
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB) | HTML iconHTML

    Clustering spatial data is a well-known problem that has been extensively studied. Grouping similar data in large 2-dimensional spaces to find hidden patterns or meaningful sub-groups has many applications such as satellite imagery, geographic information systems, medical image analysis, marketing, computer visions, etc. Although many methods have been proposed in the literature, very few have con... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using the F2 OODBMS to support incremental knowledge acquisition

    Publication Year: 2002, Page(s):266 - 275
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (613 KB) | HTML iconHTML

    Ripple down rules (RDR) is an incremental knowledge acquisition (KA) methodology, where a knowledge base (KB) is constructed as a collection of rules with exceptions. Nested ripple down rules (NRDR) is an extension of this methodology which allows the expert to enter her/his own domain concepts and later refine these concepts hierarchically. In this paper we show similarities between incremental k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On implicate discovery and query optimization

    Publication Year: 2002, Page(s):2 - 11
    Cited by:  Papers (1)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (330 KB) | HTML iconHTML

    Boolean expression simplification is a well-known problem in the history of computer science. The problem of determining prime implicates from an arbitrary Boolean expression has been mostly studied in the contexts of hardware design and automated reasoning. While many of the same principles can be applied to the simplification of search conditions in ANSI SQL queries, the richness of its language... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributing CORBA views from an OODBMS

    Publication Year: 2002, Page(s):116 - 127
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB) | HTML iconHTML

    The need to distribute objects on the Internet and to offer views from databases has found a solution with the advent of CORBA. Most database management systems now offer CORBA interfaces which are generally simple mapping of the database schema to the CORBA world. This approach does not address all the problems of database interoperation because (i) such a view is static (ii) its semantic is comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • View merging in the context of view selection

    Publication Year: 2002, Page(s):33 - 42
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (327 KB) | HTML iconHTML

    Materialized views can provide massive improvements in query processing time, especially for aggregation queries over large tables. To achieve the potential of materialized views, we must determine what views to materialize. An important issue in view selection is view merging. View merging can take a set of candidate views generated by analyzing queries in a workload, and produce a set of merged ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistency in data warehouse dimensions

    Publication Year: 2002, Page(s):224 - 232
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB) | HTML iconHTML

    Data warehouses present a powerful framework for storing and analyzing huge amounts of data. In this context analyses focus on data that has been gathered over long periods of time, often between one and five years. A data warehouse can therefore be regarded as a specialized historical database. However not only the data kept in a data warehouse has to be seen in a temporal context, but also the f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Methodology for creating a sample subset of dynamic taxonomy to use in navigating medical text databases

    Publication Year: 2002, Page(s):276 - 284
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (374 KB) | HTML iconHTML

    The amount of text available in electronic form is increasing, especially since the rise of the Web. So too are the potential interconnections between concepts, given the advent of ontologies and other relationship based data sources. Text could be navigated using the structure from the ontologies, specifically, using dynamic taxonomies to navigate the is-a relationships. Dynamic taxonomies are ro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interval processing with the UB-Tree

    Publication Year: 2002, Page(s):12 - 22
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (395 KB) | HTML iconHTML

    Advanced data warehouses and Web databases have set the demand for processing large sets of time ranges, quality classes, fuzzy data, personalized data and extended objects. Since, all of these data types can be mapped to intervals, interval indexing can dramatically speed up or even be an enabling technology for these new applications. We introduce a method for managing intervals by indexing the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completing CAD data queries for visualization

    Publication Year: 2002, Page(s):130 - 139
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (950 KB) | HTML iconHTML

    A system has been developed permitting database queries over data extracted from a CAD system where the query result is returned back to the CAD for visualization and analysis. This has several challenges. First, CAD data representations use complex object-oriented schemas and the query language must be object-oriented too. Second, the query system resides outside the CAD system and must therefore... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nearest neighbor and reverse nearest neighbor queries for moving objects

    Publication Year: 2002, Page(s):44 - 53
    Cited by:  Papers (39)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (357 KB) | HTML iconHTML

    With the proliferation of wireless communications and the rapid advances in technologies for tracking the positions of continuously moving objects, algorithms for efficiently answering queries about large numbers of moving objects increasingly are needed. One such query is the reverse nearest neighbor (RNN) query that returns the objects that have a query object as their closest object. While algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rule termination analysis investigating the interaction between transactions and triggers

    Publication Year: 2002, Page(s):285 - 294
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (659 KB) | HTML iconHTML

    We introduce a new method for rule termination analysis within active databases. This method analyzes the interaction between transactions and triggers, by means of evolution graphs. In this paper trigger information and transaction updates are considered in order to study rule termination and simulate execution. First we present the algorithm for testing rule termination and then show that severa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An index structure for improving closest pairs and related join queries in spatial databases

    Publication Year: 2002, Page(s):140 - 149
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (354 KB) | HTML iconHTML

    Spatial databases have grown in importance in various fields. Together with them come various types of queries that need to be answered effectively. While queries involving a single data set have been studied extensively, join queries on multi-dimensional data like the k-closest pairs and the nearest neighbor joins have only recently received attention. In this paper we propose a new index structu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.