期刊文献+

一个基于图的音乐数据模型与查询语言及其实现 被引量:2

A Graph-Based Music Data Model and Query Language
下载PDF
导出
摘要 图数据模型广泛应用于各种具有复杂关联数据的领域.针对现有音乐数据模型与查询语言在功能上的缺陷,首先提出了一个基于图的音乐数据模型Gra-MM,用图数据模型对复杂音乐数据进行建模,定义了图逻辑数据结构以及相关的图代数操作,然后给出了建立在Gra-MM之上的音乐数据查询语言Gra-MQL,定义了查询语言的BNF定义.Gra-MQL能够较好地处理音乐数据之间的复杂关联,同时具有音乐元数据检索和音乐内容数据检索能力,从而满足用户对音乐数据不同层次的查询需求,克服了传统图数据查询语言对复杂关联数据的表达能力有限、不能直接应用于音乐内容检索等不足.最后对实现的音乐数据库原型系统进行了介绍,对原型系统进行测试并给出实验数据,证明了模型以及查询语言的可行性. Graph data models are widely used in various area to present, store and process the data with complicated relationships. Considering the deficiency of existing music data models and query languages, this paper firstly presents a graph-based music data model named Gra-MM to model music data with complicated relationships. The definitions of model's logical data structure and algebraic operations are given. Then based on Gra-MM, we present a music data query language called Gra- MQL, with the BNF syntax of the language. Gra-MQL can handle the complicated relationships among music data well, and also has the ability to query music by meta data as well as music content data. Gra-MQL meets a variety of user requirements and overcomes the shortcomings of traditional graph query languages which do not have adequate expressive power when dealing with data that have complicated relationships and don ~ t have the ability to query music based on music content data. Finally, a brief introduction on the prototype of music database management system is given in this paper. Three queries experiments are carried out on this prototype and the performances on different datasets are given, and these experiments show that the model and query language are both feasible in practice and theory.
出处 《计算机研究与发展》 EI CSCD 北大核心 2011年第10期1879-1889,共11页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60803016 61170064) 清华信息科学与技术国家实验室(筹)学科交叉基金项目 "核高基"国家科技重大专项基金项目(2010ZX01042-002-002-01)
关键词 音乐数据模型 音乐数据查询语言 图数据模型 图数据查询语言 音乐数据管理 音乐内容 music data model music data query language graph data model graph data querylanguage music data management music content
  • 相关文献

参考文献16

  • 1Cui B, Liu L, Pu C, et al. QueST: Querying music databases by acoustic and textual features [C] //Proc of the 15th Int Conf on Multimedia. New York: ACM, 2007: 1055-1064.
  • 2He H, Singh A K. Graphs-at-a-timez Query language and access methods for graph data bases [C] //Proc of the 2008 ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2008: 405-418.
  • 3Angles R, Gutierrez C. Survey of graph database models [J]. ACM Computer Survey, 2008, 40(1): 1-39.
  • 4Gemis M, Paredaens J. An object oriented pattern matching language [C] //Proc of the First JSSST Int Syrup on Object Technologies for Advanced Software. Berlin: Springer, 1993:339-355.
  • 5Amann B, Scholl M. Gram: A graph data model and query language [C] //Proc of European Conf on Hypertext Technology. New York: ACM, 1992: 201-211.
  • 6Hirzalla N, Karmouch A. A data model and a query language for multimedia documents databases [J]. Multimedia System, 1999, 7(4): 338-348.
  • 7Zhang C, Meng W, Zhang Z, et al. WebSSQL A query language for multimedia web documents [C] //Proc of the IEEE Advances in Digital Libraries. Los Alamitos, CA: IEEE Computer Society, 2000:58-67.
  • 8Dionisio J, C'ardenas A. MQuery: A visual query language for multimedia, timeline and simulation data [J]. Journal of Visual Languages and Computing, 1996, 7(4): 377-401.
  • 9Kuo T, Chen L. A content-based query language for video databases [C] //Proc of IEEE Int Conf on Multimedia Computing and Systems. Berlin: Springer, 1996: 209-214.
  • 10Wang C, Wang J, Li J, et al. MuSQL: A music structured query language [G]//Advances in Multimedia Modeling. Berlin: Springer, 2006: 216-225.

二级参考文献27

  • 1R. Agrawal, T. Imielinski, A. Swami. Mining association rules between sets of items in large databases. The 1993 ACM SIGMOD Int'l Conf. on Management of Data, Washington, D.C. USA,1993.
  • 2R. Agrawal, R. Srikant. Fast algorithms for mining association rules in large databases. The 20th Int'l Conf. on Very Large Databases, Santiago, Chile, 1994.
  • 3R. Agarwal, C. Aggarwal, V. V. V. Prasad. A tree projection algorithm for generation of frequent itemsets. Journal of Parallel and Distributed Computing (Special Issue on High Performance Data Mining), 2001, 61(3): 350--371.
  • 4J. Han, J. Pei, Y. Yin. Mining frequent patterns without candidate generation. The 2000 ACM SIGMOD Int'l Conf. on Management of Data, Dallas, USA, 2000.
  • 5H. Mannila, H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1997, 1(3): 241--258.
  • 6Lin DaoI, Kedem, Z. M. Pincer-Search: A new approach for discovering the maximum frequent set. The 6th European Conf. on Extending Database Technology, Valencia, Spain. 1998.
  • 7R. J. Bayardo. Efficiently mining long patterns from databases.The 1998 ACM SIGMOD Int'l Conf. on Management of Data,Seattle, Washington, USA, 1998.
  • 8Ramesh C. Agarwal, Charu C. Aggarwal, V. V. V. Prasad.Depth-first generation of long patterns. The 6th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, Boston,MA, USA, 2000.
  • 9Doug Burdick, Manuel Calimlim, Johannes Gehrke. Mafia; A maximal frequent itemset algorithm for transactional databases. The17th Int'l Conf. on Data Engineering, Heidelberg, Germany,2001.
  • 10K. Gouda, M. J. Zaki. Efficiently mining maximal frequent itemsets. The 1st IEEE Int'l Conf. on Data Mining (ICDM), San Jose, USA, 2001.

共引文献22

同被引文献4

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部