南華大學機構典藏系統:Item 987654321/21367
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 18278/19583 (93%)
Visitors : 2015531      Online Users : 293
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://nhuir.nhu.edu.tw/handle/987654321/21367


    Title: 無線廣播頻道有效查詢過程中的資料配置使用Apriori演算法
    Other Titles: Data Allocation on Wireless Broadcast Channels for Efficient Query Processing using Apriori Algorithms
    Authors: 張桐旗
    Chang, Tung-chi
    Contributors: 資訊管理學研究所
    吳光閔
    Guang-Ming Wu
    Keywords: 存取時間;行動計算;資料庫
    Database;Mobile computing;Access time
    Date: 2003
    Issue Date: 2015-06-04 10:21:17 (UTC+8)
    Abstract:   電腦科技進步,行動計算環境技術亦趨成熟,個人行動通訊設備的發展與普及,廣播資料將會被廣泛擴大的應用在網域。在本論文中,將資料庫發展由傳統資料庫、行動資料庫、廣播資料庫,探討資料庫演進以及資料探勘理論中關聯法則最主要的演算法之一Apriori演算法來探討無線廣播資料頻道的有效分配,使用者從廣播資料上執行複雜查詢時,可以呈現最佳查詢處理位置,將查詢的資料庫放在靠近每一個廣播頻道的位置,可以減少處理複雜的查詢存取時間與查詢處理的位置。實驗證明我們的方法與Random比,快10 %。 
      As computer technology is continue progress, the environment of mobile computing is more mature.The personal mobile communication equipment is development and popular, and the broadcast data will be widespread use on Internet. In this paper, we will probe into the evolution of database form its development: tradition database, mobile database, and broadcast database. And use Apriori algorithms, the one of the algorithms of data mining association rule to research the efficient of data allocation on wireless broadcast channels. When user make a complex query into the broadcast data, we can show the best position in the query processing. Put the query data near to each broadcast channel position, can reduce the access time of a complex query and query processing position. The result of experiment improve that our method is 10% faster than random.  
    Appears in Collections:[Department of Information Management] Disserations and Theses

    Files in This Item:

    File Description SizeFormat
    091NHU05396007-001.pdf633KbAdobe PDF299View/Open
    index.html0KbHTML292View/Open


    All items in NHUIR are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback