By Topic

Data Engineering, 2001. Proceedings. 17th International Conference on

Date 2-6 April 2001

Filter Results

Displaying Results 1 - 25 of 76
  • Proceedings 17th International Conference on Data Engineering [front matter]

    Publication Year: 2001
    Save to Project icon | Request Permissions | PDF file iconPDF (314 KB)  
    Freely Available from IEEE
  • Author index

    Publication Year: 2001 , Page(s): 665 - 666
    Save to Project icon | Request Permissions | PDF file iconPDF (136 KB)  
    Freely Available from IEEE
  • Discovery and application of check constraints in DB2

    Publication Year: 2001 , Page(s): 551 - 556
    Cited by:  Patents (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (388 KB) |  | HTML iconHTML  

    The traditional role of integrity constraints is to protect the integrity of data, but integrity constraints can and do play other roles in databases; for example, they can be used for query optimization. In this role, they do not need to model the domain; it is sufficient that they describe regularities that are true about the data currently stored in a database. In this paper, we describe two al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Selectivity estimation for spatial joins

    Publication Year: 2001 , Page(s): 368 - 375
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (784 KB) |  | HTML iconHTML  

    Spatial joins are important and time consuming operations in spatial database management systems. It is crucial to be able to accurately estimate the performance of these operations so that one can derive efficient query execution plans, and even develop/refine data structures to improve their performance. While estimation techniques for analyzing the performance of other operations, such as range... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An automated change-detection algorithm for HTML documents based on semantic hierarchies

    Publication Year: 2001 , Page(s): 303 - 312
    Cited by:  Papers (4)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1124 KB) |  | HTML iconHTML  

    The data at many Web sites is changing rapidly, and a significant amount of this data is presented in HTML documents that consist of markups and data contents. Although XML is becoming more popular for data exchange, the presentation of data contained in XML documents is given, by and large, in the HTML format using XSL(T). Since HTML was designed to “display” data from the human persp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A cost model and index architecture for the similarity join

    Publication Year: 2001 , Page(s): 411 - 420
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1028 KB) |  | HTML iconHTML  

    The similarity join is an important database primitive which has been successfully applied to speed up data mining algorithms. In the similarity join, two point sets of a multidimensional vector space are combined such that the result contains all point pairs where the distance does not exceed a parameter ε. Due to its high practical relevance, many similarity join algorithms have been devise... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An XML indexing structure with relative region coordinate

    Publication Year: 2001 , Page(s): 313 - 320
    Cited by:  Papers (7)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (616 KB) |  | HTML iconHTML  

    For most of the index structures for XML data proposed so far, updating is a problem, because an XML element's coordinates are expressed using absolute values. Due to the structural relationship among the elements in XML documents, we have to re-compute these absolute values if the content of the source data is updated. The reconstruction requires the updating of a large portion of the index files... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The importance of extensible database systems for e-commerce

    Publication Year: 2001 , Page(s): 63 - 70
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (592 KB) |  | HTML iconHTML  

    Over the last decade, database system products have been extended to provide support for defining, storing, updating, indexing and retrieving complex data with full transaction semantics. Oracle, IBM, Informix and others have used extensibility technology to build database system extensions for text, image, spatial, audio/video, chemical, genetic and other types of complex data. Currently, we find... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-level parallelisation in a database cluster: a feasibility study using document services

    Publication Year: 2001 , Page(s): 121 - 130
    Cited by:  Papers (1)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (852 KB) |  | HTML iconHTML  

    Our concern is the design of a scalable infrastructure for complex application services. We want to find out if a cluster of commodity database systems is well-suited as such an infrastructure. To this end, we have carried out a feasibility study based on document services, e.g. document insertion and retrieval. We decompose a service request into short parallel database transactions. Our system, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating semi-join-reducers into state-of-the-art query processors

    Publication Year: 2001 , Page(s): 575 - 584
    Cited by:  Papers (3)  |  Patents (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (796 KB) |  | HTML iconHTML  

    Semi-join reducers were introduced in the late 1970s as a means to reduce the communication costs of distributed database systems. Subsequent work in the 1980s showed, however, that semi-join reducers are rarely beneficial for the distributed systems of that time. This paper shows that semi-join reducers can indeed be beneficial in modern client-server or middleware systems - either to reduce comm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache-on-demand: recycling with certainty

    Publication Year: 2001 , Page(s): 633 - 640
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (600 KB) |  | HTML iconHTML  

    Queries posed to a database usually access some common relations, or share some common sub-expressions. We examine the issue of caching using a novel framework, called cache-on-demand (CoD). CoD views intermediate/final answers of existing running queries as virtual caches that an incoming query can exploit. Those caches that are beneficial may then be materialized for the incoming query. Such an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spatial clustering in the presence of obstacles

    Publication Year: 2001 , Page(s): 359 - 367
    Cited by:  Papers (27)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (756 KB) |  | HTML iconHTML  

    Clustering in spatial data mining is to group similar objects based on their distance, connectivity, or their relative density in space. In the real world there exist many physical obstacles such as rivers, lakes and highways, and their presence may affect the result of clustering substantially. We study the problem of clustering in the presence of obstacles and define it as a COD (Clustering with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using EELs, a practical approach to outerjoin and antijoin reordering

    Publication Year: 2001 , Page(s): 585 - 594
    Cited by:  Papers (2)  |  Patents (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (796 KB) |  | HTML iconHTML  

    Outerjoins and antijoins are two important classes of joins in database systems. Reordering outerjoins and antijoins with innerjoins is challenging because not all the join orders preserve the semantics of the original query. Previous work did not consider antijoins and was restricted to a limited class of queries. We consider using a conventional bottom-up optimizer to reorder different types of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • E-business applications for supply chain management: challenges and solutions

    Publication Year: 2001 , Page(s): 71 - 78
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (700 KB) |  | HTML iconHTML  

    Supply-chain management is a crucial activity in every company. Surprisingly, today, most of the supply-chain activities are carried out manually, and IT support is often limited to having a set of (disconnected) data repositories. In addition, business-to-business (B2B) communications are performed via phone, fax or e-mail. Increasing the operational efficiency of the supply chain results in huge... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An index structure for efficient reverse nearest neighbor queries

    Publication Year: 2001 , Page(s): 485 - 492
    Cited by:  Papers (22)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (596 KB) |  | HTML iconHTML  

    The Reverse Nearest Neighbor (RNN) problem is to find all points in a given data set whose nearest neighbor is a given query point. Just like the Nearest Neighbor (NN) queries, the RNN queries appear in many practical situations such as marketing and resource management. Thus, efficient methods for the RNN queries in databases are required. The paper introduces a new index structure, the Rdnn-tree... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model-based mediation with domain maps

    Publication Year: 2001 , Page(s): 81 - 90
    Cited by:  Papers (6)  |  Patents (9)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (784 KB) |  | HTML iconHTML  

    Proposes an extension to current view-based mediator systems called “model-based mediation”, in which views are defined and executed at the level of conceptual models (CMs) rather than at the structural level. Structural integration and lifting of data to the conceptual level is “pushed down” from the mediator to wrappers which, in our system, export the classes, associatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient sequenced temporal integrity checking

    Publication Year: 2001 , Page(s): 131 - 140
    Cited by:  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (772 KB) |  | HTML iconHTML  

    Primary key and referential integrity are the most widely used integrity constraints in relational databases. Each has a sequenced analogue in temporal databases, in which the constraint must apply independently at every point in time. In this paper, we assume a stratum approach, which expresses the checking in conventional SQL, as triggers on period-stamped relations. We evaluate several novel ap... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An index-based approach for similarity search supporting time warping in large sequence databases

    Publication Year: 2001 , Page(s): 607 - 614
    Cited by:  Papers (25)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (632 KB) |  | HTML iconHTML  

    This paper proposes a new novel method for similarity search that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. Previous methods for processing similarity search that supports time warping fail to employ multi-dimensional indexes without false dismissal since the time warping distance does no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Counting twig matches in a tree

    Publication Year: 2001 , Page(s): 595 - 604
    Cited by:  Papers (24)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (840 KB) |  | HTML iconHTML  

    Describes efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e. a twig, in a large node-labeled tree, using a summary data structure. This problem is of interest for queries on XML and other hierarchical data, to provide query feedback and for cost-based query optimization. Our summary data structure scalably represents approximate frequency inform... View full abstract»

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

    Publication Year: 2001 , Page(s): 477 - 481
    Cited by:  Papers (8)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (436 KB) |  | HTML iconHTML  

    Web based application developers are attempting to move towards Web services as a mechanism for developing component based Web applications. Unfortunately, traditional tools and development models are inadequately architected to meet the rapidly evolving needs for the future of scalable Web services. Today's Web services development model is mired with complexity as traditional tools and technolog... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processing queries with expensive functions and large objects in distributed mediator systems

    Publication Year: 2001 , Page(s): 91 - 98
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (764 KB) |  | HTML iconHTML  

    LeSelect is a mediator system which allows scientists to publish their resources (data and programs) so they can be transparently accessed. The scientists can typically issue queries which access distributed published data and involve the execution of expensive functions (corresponding to programs). Furthermore, the queries can involve large objects, such as images (e.g. archived meteorological sa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining partially periodic event patterns with unknown periods

    Publication Year: 2001 , Page(s): 205 - 214
    Cited by:  Papers (23)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (788 KB) |  | HTML iconHTML  

    Periodic behavior is common in real-world applications. However in many cases, periodicities are partial in that they are present only intermittently. The authors study such intermittent patterns, which they refer to as p-patterns. The formulation of p-patterns takes into account imprecise time information (e.g., due to unsynchronized clocks in distributed environments), noisy data (e.g., due to e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Nimble XML data integration system

    Publication Year: 2001 , Page(s): 155 - 160
    Cited by:  Papers (13)  |  Patents (6)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (472 KB) |  | HTML iconHTML  

    For better or for worse, XML has emerged as a de facto standard for data interchange. This consensus is likely to lead to increased demand for technology that allows users to integrate data from a variety of applications, repositories, and partners, which are located across the corporate intranet or on the Internet. Nimble Technology has spent two years developing a product to service this market.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating data mining with SQL databases: OLE DB for data mining

    Publication Year: 2001 , Page(s): 379 - 387
    Cited by:  Papers (6)  |  Patents (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (780 KB) |  | HTML iconHTML  

    The integration of data mining with traditional database systems is key to making it convenient, easy to deploy in real applications, and to growing its user base. We describe the new API for data mining proposed by Microsoft as extensions to the OLE DB standard. We illustrate the basic notions that motivated the API's design and describe the key components of an OLE DB for the data mining provide... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SpinCircuit: a collaborative portal powered by E-speak

    Publication Year: 2001 , Page(s): 661 - 663
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (196 KB) |  | HTML iconHTML  

    SpinCircuit is collaborative portal serving the semiconductor industry. SpinCircuit provides a Web-based environment facilitating B-2-B collaboration to bring together component manufacturers, component suppliers, contract manufacturers and the design community in semiconductor space. It is based on E-speak technology from Hewlett-Packard. E-speak provides a secure E-services infrastructure for th... View full abstract»

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