Scheduled Maintenance on March 25th, 2017:
Single article purchases and IEEE account management will be unavailable from 4:00 AM until 6:30 PM (ET). We apologize for the inconvenience.
By Topic

Proceedings 17th International Conference on Data Engineering

2-6 April 2001

Filter Results

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

    Publication Year: 2001
    Request permission for commercial reuse | PDF file iconPDF (314 KB)
    Freely Available from IEEE
  • Microsoft server technology for mobile and wireless applications

    Publication Year: 2001
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (44 KB) | HTML iconHTML

    Summary form only given. Microsoft is building a number of server technologies that are targeted at mobile and wireless applications. These technologies cover a wide range of customer scenarios and application requirements. The article discusses some of these technologies in detail. View full abstract»

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

    Publication Year: 2001, Page(s):665 - 666
    Request permission for commercial reuse | PDF file iconPDF (136 KB)
    Freely Available from IEEE
  • SpinCircuit: a collaborative portal powered by E-speak

    Publication Year: 2001, Page(s):661 - 663
    Request permission for commercial reuse | 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.
  • High-level parallelisation in a database cluster: a feasibility study using document services

    Publication Year: 2001, Page(s):121 - 130
    Cited by:  Papers (5)  |  Patents (3)
    Request permission for commercial reuse | 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.
  • Prefetching based on the type-level access pattern in object-relational DBMSs

    Publication Year: 2001, Page(s):651 - 660
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB) | HTML iconHTML

    Prefetching is an effective method for minimizing the number of round-trips between the client and the server in database management systems. We propose new notions of the type-level access locality and the type-level access pattern. We also formally define the notions of capturing and prefetching to help understand the underlying mechanisms. We then develop an efficient prefetching policy based o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bundles in captivity: an application of superimposed information

    Publication Year: 2001, Page(s):111 - 120
    Cited by:  Papers (7)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1252 KB) | HTML iconHTML

    What do you do to make sense of a mass of information on a given topic? Paradoxically, you likely add yet more information to the pile: annotations, underlining, bookmarks, cross-references, etc. We want to build digital information systems for managing such added or superimposed information and support applications that create and manipulate it. We find that requirements for a superimposed inform... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache-aware query routing in a cluster of databases

    Publication Year: 2001, Page(s):641 - 650
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB) | HTML iconHTML

    We investigate query routing techniques in a cluster of databases for a query-dominant environment. The objective is to decrease query response time. Each component of the cluster runs an off-the-shelf DBMS and holds a copy of the whole database. The cluster has a coordinator that routes each query to an appropriate component. Considering queries of realistic complexity, e.g., TPC-R, this article ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measuring and optimizing a system for persistent database sessions

    Publication Year: 2001, Page(s):21 - 30
    Cited by:  Papers (3)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB) | HTML iconHTML

    High availability for both data and applications is rapidly becoming a business requirement. While database systems support recovery, providing high database availability, applications may still lose work because of server outages. When a server crashes, any volatile state associated with the application's database session is lost and the application may require an operator-assisted restart. This ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High-performance, space-efficient, automated object locking

    Publication Year: 2001, Page(s):163 - 172
    Cited by:  Papers (1)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB) | HTML iconHTML

    Studies the impact of several lock manager designs on the overhead imposed on a persistent programming language by automated object locking. Our study reveals that a lock management method based on lock-state sharing outperforms more traditional lock management designs. Lock-state sharing is a novel lock management method that represents all lock data structures with equal values with a single sha... 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 (12)  |  Patents (3)
    Request permission for commercial reuse | 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.
  • An XML indexing structure with relative region coordinate

    Publication Year: 2001, Page(s):313 - 320
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | 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.
  • Tuning an SQL-based PDM system in a worldwide client/server environment

    Publication Year: 2001, Page(s):99 - 108
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB) | HTML iconHTML

    The management of product-related data in a uniform and consistent way is a big challenge for many manufacturing enterprises, especially the large ones, like DaimlerChrysler. So-called product data management (PDM) systems are a promising way to achieve this goal. For various reasons, PDM systems often sit on top of a relational DBMS, using it (more or less) as a simple record manager. User intera... 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)
    Request permission for commercial reuse | 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.
  • A split operator for now-relative bitemporal databases

    Publication Year: 2001, Page(s):41 - 50
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB) | HTML iconHTML

    The timestamps of now-relative bitemporal databases are modeled as growing, shrinking or rectangular regions. The shape of these regions makes it a challenge to design bitemporal operators that (a) are consistent with the point-based interpretation of a temporal database, (b) preserve the identity of the argument timestamps, (c) ensure locality and (d) perform efficiently. We identify the bitempor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distinctiveness-sensitive nearest-neighbor search for efficient similarity retrieval of multimedia information

    Publication Year: 2001, Page(s):493 - 502
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB) | HTML iconHTML

    Nearest neighbor (NN) search in high dimensional feature space is widely used for similarity retrieval of multimedia information. However recent research results in the database literature reveal that a curious problem happens in high dimensional space. Since high dimensional space has a high degree of freedom, points could be scattered so that every distance between them might yield no significan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A graph-based approach for extracting terminological properties of elements of XML documents

    Publication Year: 2001, Page(s):330 - 337
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB) | HTML iconHTML

    XML is rapidly becoming a standard for information exchange over the Web. Web providers and applications using XML for representing and exchanging their data make their information available in such a way that interoperability can be easily reached. However in order to guarantee both the exchange of XML documents and the interoperability between information providers, it is often needed to single ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B-tree indexes and CPU caches

    Publication Year: 2001, Page(s):349 - 358
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (944 KB) | HTML iconHTML

    Since many existing techniques for exploiting CPU caches in the implementation of B-tree indexes have not been discussed in the literature, most of them are surveyed. Rather than providing a detailed performance evaluation for one or two of them on some specific contemporary hardware, the purpose is to survey and to make widely available this heretofore-folkloric knowledge in order to enable, stru... 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
    Cited by:  Papers (4)
    Request permission for commercial reuse | 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.
  • Integrating semi-join-reducers into state-of-the-art query processors

    Publication Year: 2001, Page(s):575 - 584
    Cited by:  Papers (2)  |  Patents (9)
    Request permission for commercial reuse | 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.
  • Workflow and process synchronization with interaction expressions and graphs

    Publication Year: 2001, Page(s):243 - 252
    Cited by:  Papers (3)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB) | HTML iconHTML

    Current workflow management technology does not provide adequate means for inter-workflow coordination as concurrently executing workflows are considered completely independent. While this simplified view might suffice for one application domain or the other, there are many real-world application scenarios where workflows, though independently modeled in order to remain comprehensible and manageab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database managed external file update

    Publication Year: 2001, Page(s):557 - 564
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB) | HTML iconHTML

    Relational DBMSs (RDBMSs) have evolved to an extent that they are used to manage almost all traditional business data in a robust fashion. Nevertheless, a large fraction of unstructured and semi-structured data continues to be managed by file systems. As companies increasingly depend on non-traditional data for their daily business operations, it becomes more and more important to provide higher d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining frequent itemsets with convertible constraints

    Publication Year: 2001, Page(s):433 - 442
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB) | HTML iconHTML

    Recent work has highlighted the importance of the constraint based mining paradigm in the context of frequent itemsets, associations, correlations, sequential patterns, and many other interesting patterns in large databases. The authors study constraints which cannot be handled with existing theory and techniques. For example, avg(S) θ ν, median(S) θ ν, sum(S) θ ν (S can... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IBM DB2 Everyplace: a small footprint relational database system

    Publication Year: 2001, Page(s):230 - 232
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    Handheld and embedded devices are becoming increasingly popular and their uses are more versatile. Applications on these devices often need storing, retrieving and synchronizing of data. IBM DB2 Everyplace is a high performance small footprint DBMS that is targeted at this market segment. The authors describe the overall architecture, features and several design considerations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable length queries for time series data

    Publication Year: 2001, Page(s):273 - 282
    Cited by:  Papers (27)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB) | HTML iconHTML

    Finding similar patterns in a time sequence is a well-studied problem. Most of the current techniques work well for queries of a prespecified length, but not for variable length queries. We propose a new indexing technique that works well for variable length queries. The central idea is to store index structures at different resolutions for a given dataset. The resolutions are based on wavelets. F... View full abstract»

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