TAILIEUCHUNG - Indexing XML Data Stored in a Relational Database

In traditional SAS programs, PROCS are called as part of a workflow that usually includes SAS DATA steps along with PROC steps, which invoke SAS procedures. For example, a very basic SAS program includes a DATA step that creates the SAS data set from raw data files and a PROC step that invokes an appropriate SAS procedure to process the SAS data set. A PROC invocation typically takes one or more tables as input and produces a new table as output. Various programming options and control statements can also be specified on the PROC invocation. These dictate how the PROC. | Indexing XML Data Stored in a Relational Database Shankar Pal Istvan Cseri Oliver Seeliger Gideon Schaller Leo Giakoumakis Vasili Zolotov Microsoft Corporation One Microsoft Way Redmond WA 98052 USA shankarp istvanc oliverse gideons leogia vasilizo @ Abstract As XML usage grows for both data-centric and document-centric applications introducing native support for XML data in relational databases brings significant benefits. It provides a more mature platform for the XML data model and serves as the basis for interoperability between relational and XML data. Whereas query processing on XML data shredded into one or more relational tables is well understood it provides limited support for the XML data model. XML data can be persisted as a byte sequence BLOB in columns of tables to support the XML model more faithfully. This introduces new challenges for query processing such as the ability to index the XML blob for good query performance. This paper reports novel techniques for indexing XML data in the upcoming version of Microsoft SQL Server and how it ties into the relational framework for query processing. 1. Introduction Introducing XML 3 support in relational databases has been of keen interest in the industry in the past few years. One solution is to generate XML from a set of tables based on an XML schema definition and to decompose XML instances into such tables 2 5 11 16 20 . Once shredded into tables the full power of the relational engine such as indexing using B trees and query capabilities can be used to manage and query the data. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage the VLDB copyright notice and the title of the publication and its date appear and notice is given that copying is by permission of the Very Large Data Base Endowment. To copy otherwise or to republish requires a fee and or special permission from the Endowment

TÀI LIỆU MỚI ĐĂNG
309    143    0    29-12-2024
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.