Understanding User Operations on Web Page in WISE 1
|
|
- Christina Martin
- 5 years ago
- Views:
Transcription
1 Understanding User Operations on Web Page in WISE 1 Hongyan Li, Ming Xue, Jianjun Wang, Shiwei Tang, and Dongqing Yang National Laboratory on Machine Perception, School of Electronics Engineering and Computer Science, Peking University, Beijing, , P. R. China {lihy, xueming, wangjj}@cis.pku.edu.cn, {tsw, ydq}@pku.edu.cn Abstract. Unlike Internet portals, a typical Web Information System contains lots of user operations. However, existing Web design frameworks focus exclusively on data presentation: the process of user operations is still achieved through low-level programming. That makes WIS hard to be constructed or maintained. In a Web Information System auto-construction Environment (WISE), the translation of user operations to concrete data processing code in persistent data sources is explored. This paper discusses the semantics of typical operations. The implementation code of those operations can be auto-generated with the aid of the mapping from template attributes to persistent objects. 1 Introduction Web Information System [1] (WIS) often contains hundreds or thousands of linked Web pages with structured data and operations defined on them. WIS fetches resources by Web technologies, manipulates information to accomplish business process, and provide more openness and flexibility to various end users. Let s take a Web-based hospital information system used by Shanghai Renji Hospital in China for example. It contains 335 pages in its inpatient management subsystem. Each contains one to over ten operations. It s easy to see that data operation similarity as well as structure similarity or presentation similarity exist among pages. Constructing Web pages manually is a repeatable work, and the maintenance is ever more troublesome. WIS requires an auto-generating of those data-driven pages. But the gap between information processing on pages and underlying data sources made that a difficult job. 2 Related Work How to construct WIS automatically becomes a challenging research field. Many methodologies contribute to that work [2]. For instance, Relationship Management Methodology [3], Object Oriented Hypermedia Design Methodology [4] and UML based Web Engineering have been developed to support a hypermedia design process. They 1 This work was supported by Natural Science Foundation of China(NSFC) under grant number W. Fan, Z. Wu, and J. Yang (Eds.): WAIM 2005, LNCS 3739, pp , Springer-Verlag Berlin Heidelberg 2005
2 Understanding User Operations on Web Page in WISE 847 succeed in identifying different steps to be taken in development of Web applications, but still need users to write code for data operation processing on Web pages. Most of other methodologies like UIDE [5], Mecano [6], Hera [7] and template methods [9] only concentrate on data structure or presentation similarity. None of them devote in the process and semantics of user operations even a few did process Search implicatedly. There are two ways for auto-building of WIS: a top-down approach and a bottomup one. The former generates Web pages according to user requirements and organizes persistent data according to page structures. [8] gives such an example. This method is easy to satisfy users, but cannot be applied in complex systems due to hard maintenance of persistent data caused by inevitable redundancy. It also fails to meet the situation when WIS must be built on a legacy source. The latter, mostly those hypermedia presentation methods, starts from persistent data design usually with the help of a DBMS, and then generates Web presentation of data. But it can hardly support auto-process of arbitrary user operations on Web pages since business data is organized by a database designer and often not for the convenient use of end users. WISE tries a trade-off method: Web pages are generated by template model which includes definitions of structured data and operations. If a data source is present, no matter it is a legacy system or not, a mapping strategy is adopted to bridge the gap between Web applications and persistent data. After all template items map to a data source, the general user operations can map to concrete operations on that data source. The operation mapping method forms a part of our WIS auto-construction framework and is used to generate operation processing code. 3 Template Operations This paper will discuss the built-in operations in WISE: Link, Search, Clear, Modify and Add. Link is defined on a sub template attribute or a component of a template instance. It s used for navigation among templates. Let T be a template and Attrs(T) be the set of attributes of T, Search, Clear and Modify could be defined on two disjoint subsets of Attrs(T). One is used for receive user input and generates operation constraints and denoted by CA S/C/M. The other is used for receive output from underlying persistent data source and denoted by TA S/C/M. TA C also generates Clear candidates and TA M receives new value input by users. Add could be defined on only one subsets of Attrs(T), which is used for receive input from users and generates new instances and denoted by TA A. 4 Mapping Template Attributes to DBMS Because of the structure similarity between template and nested table, one could regard template as a logic view. That viewpoint makes mapping template attributes and operations to data source possible. On the other hand, data source often use DBMS to manage business data. Those data is organized according to database storage strategy, not to template scheme. So mapping template attributes and operations to data source is necessary.
3 848 H. Li et al. Given a template T and an attributes A of T, if A has a source D in data source M, we say D is the origin of A in M. Otherwise, A has no origin in M. If A has an origin D in M, and D can be presented as such a SQL statement: SELECT S FROM T 1,,T n (n 1)[WHERE W], we say A has a basic origin in M. Let OS M (A) be the target expression in Select clause, OF M (A) be the set of tables(or views) in From clause, and OW M (A) be possible conditions in Where clause. OS M (A), OF M (A) and OW M (A) is called the original target, original range and original condition of A in M respectively. An attribute may have an origin but not a basic one in a data source. To find basic origins of all template attributes is a preliminary work for the operation process. Constraint 1. Given a template T, o {Search,Add,Modify,Clear} and A CA o TA o, if o could be converted to an operation on data source M, A has a basic origin in M. The process of Link is much simpler than the rest four built-in operations. The process of Search is similar to the query conversion method describe in [11]. So the rest of this paper only presents the disposal of Add, Clear, and Modify. 5 Add Let TA A ={A 1,,A n }(n 1), for A i (1 i n), the value of A i would be inserted into one table in a data source. So OF M (A i ) =1 is met. Since not all data manipulations defined on views could be executed successfully in DBMS, the following constraint is made. Constraint 2. Given a template T, o {Add,Modify,Clear}, and A CA o TA o, if o could be converted to an operation on data source M, OF M (A) is a certain table. In traditional DBMS, Insert, Update and Delete could process only a single table each time. But in WIS, users need to define operations mapping to a process on multiple tables at a same time. So the original ranges of different Add target may be different. The following steps explain in detail how to process Add operation. Step1. Arrange all attributes in TA A into m groups: the original range of each group is the same, while the original ranges of different groups are different. Step2. Let T i (1 i m) be the original range of i-th group. Collect all Key-Foreign Key Constraints(K-FKC) among tables T 1,,T m from data source M. Generate the constraint dependency graph G M (Add): (1) For T i (1 i m), there s a certain vertex V Ti in G M (Add) mapping to it. (2) If T j s foreign key references T i s key, add directed edge from T i to T j. (3) If T 1,, T k (k 1) and T i T 1 T k T j T i T 1 T k T j, from p=1 to k, add vertex V Tp into G M (Add) if V Tp is not in G M (Add). Add directed edge from V Ti to V T1,, and from V Tk to V Tj if that edge is not in G M (Add). Step3. If there s no loop in G M (Add), insert into those tables mapping to zero indegree vertexes firstly. Suppose T i is such a table. It s also the original range of i-th group {A i1,,a ik }. Those attributes form the scheme of Add instance [A i1,,a ik ] which could be converted to T i s insert scheme [OS M (A i1 ),,OS M (A ik )]. User input values of A i1,, and A ik form T i s insert instance (V Ai1,,V Aik ). Now we get the SQL statement: INSERT INTO T i (OS M (A i1 ),,OS M (A ik )) VALUES (V Ai1,,V Aik ).
4 Understanding User Operations on Web Page in WISE 849 Repeat this step till all tables mapping to zero in-degree vertexes could be inserted. Step4. Check a p(p 1) in-degree vertex V T in G M (Add). T could be inserted if all tables mapping to V T s preceding vertexes have be inserted correctly. Let V Ti (1 i<p) be such a preceding vertex. According to Step2, we know T has a foreign key FK i referencing T i s key K i. If T is the original range of j-th group {A j1,,a jk }(k n), T s insert scheme is [OS M (A j1 ),,OS M (A jk ),FK 1,,FK p ] and insert instance is (V Aj1,, V Ajk,V FK1,,V FKp ). Here V FKi is the component value agrees in K i for T i s insert instance. If T s not a original range of any group, V T must be a vertex added in Step2 (3). T s insert scheme is [FK 1,,FK p ] and insert instance is (V FK1,,V FKp ). Repeat this step till all tables mapping to all vertexes in G M (Add) could be inserted. If there s a loop in G M (Add), all tables mapping to vertexes in that loop couldn t be inserted until at least one K-FKC on those tables is disabled. Then one could follow Step3 and Step4 to fulfill Add operation. 6 Clear Step1. Clear condition is generated according to input value received by CA C, while TA C will be used for receive outputs from data source. This sub process is similar to Search process except that Constraint2 should be abided. We call it the preceding search of Clear operation and produce a select statement S for it. When a Clear map to a table s deleting, the process is very simple. Is it possible to define Clear involves multiple tables? Let s take Fig.1 for example. Suppose the origins of t 1 and t 2 of template T in data source M are: OS M (t 1 )=A.a 1, OF M (t 1 )=A, OS M (t 2 )=B.b 2, and OF M (t 2 )=B. The tuples of table A and B are shown in Fig.1(a) and (b). If there s a join path A B and the corresponding join condition is A.a 2 =B.b 1, executing the preceding search, we ll get Clear candidates as shown in (c). It s easy to see that not every candidate could map to a unique tuple of A or B, and vice versa. (a) Table A (b) Table B (C) Template T (d) Template T a 1 a 2 b 1 b 2 b 3 t 1 (A.a 1 ) t 2 (B.b 2 ) t 1 (A.a 1 ) t 2 (B.b 2 ) Fig. 1. An example for Clear processing When one candidate is mapping to multiple tuples of a single table, template instance clear brings on the uncertainty in tuple delete. For example, (3,8) of T shown in (c) may be generated from the join of (3,4) in A and (4,8,1) in B or (4,8,2) in B. If (3,8) is cleared, shall we delete only (4,8,1) or (4,8,2), or delete them both? That problem is caused by the filtering of duplicate tuples in query result in DBMS. The next Step will make some addition into the process of preceding search to avoid it. Step2. If there s only one table in the range of S, jump to Step3. Otherwise, let the range be {T 1,,T k }(k 2), and the set of targets be TS. For T i (1 i k), check if TS
5 850 H. Li et al. contains T i s key. If not, add one key into TS compulsively. Or add the rest attributes of T i which haven t belonged to TS in case there s no key defined on T i. Step3. Execute statement S or the evolved statement generated by Step2. Project query result on all attributes in TA C without filtering of duplicate tuples. Now we get clear candidates on T. As shown in Fig.5(d), one could regard a (3,8) is generated from the join of (3,4) in A and (4,8,1) in B, another from the join of (3,4) and (4,8,2). Let the set of Clear instances be V C ={v 1,,v n }(n 1). For v j (1 j n) and T i (1 i k), v j could map to a unique tuple of T i (denoted by v ji ) with the help of T i s key. But when multiple candidates map to a single tuple, instance clear also brings uncertainty on tuple delete. Consider (1,6) and (1,5) of T, they all map to (1,2) in A. If users only clear (1,6) or (1,5), shall we delete (1,2) from A? If we do so, another instance will never be seen in T. If we don t, the clear instance exists still. Constraint 3. Given a template T, its Clear operation could be converted to delete operation on data source M if there s only one table in original range of its preceding query, or, let the set of clear instances be V C and the set of clear candidates be VC C, for v 1 V C and v 2 (VC C -V C ), v 1 and v 2 are generated from different tuples. Step4. Check if Constraint3 is met. If so, the clear instances in V C could be converted to tuple deletes from tables in {T 1,,T k }. As for T i (1 i k), the SQL statement is DELETE FROM T i WHERE K i IN= {v 1i (K i ),,v ni (K i )}. Some tables may be added into original range because of the involvement in certain join paths. For example, the join path between table A and B in Fig.1 would be A C B instead of A B and the corresponding join condition be A.a 2 = C.c 1 and C.c 2 =B.b 1. Therefore, C is added into the original range of preceding query. But no attribute of C is in TA C. Following above steps, on delete on C is generated. But if there s K-FKC between A and C and ON DELETE CASCADE option is used in the constraint definition, referenced tuple delete from A would trigger referencing tuple delete from B. That process will be auto-executed by DBMS. 7 Modify Modify is also taken on the result of a preceding search. In order to support Modify mapping to updates on multiple tables, tuple update uncertainty is eliminated by the same method described in Clear when one candidate mapping to multiple tuples. But when multiple candidates map to a single tuple, Constraint3 is inadequate to eliminate the uncertainty. Let s consider (1,6) and (1,5) in Fig.1(d). They all map to (1,2) in A. Constraint3 ensures (1,6) and (1,5) will either be updated simultaneously or not be updated at all. But even if they are updated simultaneously, one may change (1,6) to (3,6) and (1,5) to (5,5). The update semantics on (1,2) wouldn t be consistent. Constraint 4. Given a template T, Modify could be converted to update operation on data source M if there s only one table in original range of its preceding query, or, let the set of Modify instances and candidates be V M and VC M, for v 1 V M and v 2 VC M, v 1 and v 2 are generated from different tuples. In the conversion of Modify to update on data source M, the first three steps are similar to that of Clear. The last step is presented as the following:
6 Understanding User Operations on Web Page in WISE 851 Step4. Let the set of Modify instances be V M ={v 1,,v n }(n 1). Let all attributes for v j in T consist subset {A j1,,a jm }(m 1), and the original range of {A j1,,a jm } be T i (1 i k). v j could map to a unique tuple of T i (denoted by v ji ) with the help of T i s key. Let user input value on A jo (1 o m) in v j be New(v j (A jo )). Now check if Constraint4 is met. If so, the instance Modify in V M could be converted to tuple updates on all tables in {T 1,,T k }. As for T i (1 i k), the SQL statement is: UPDATE T i SET OS M (A 11 )=New(v 1 (A 11 )),,OS M (A 1m )=New(v 1 (A 1m )),, OS M (A n1 )=New(v n (A n1 )),,OS M (A nm )=New(v n (A nm )) WHERE K i IN={v 1i (K i ),,v ni (K i )}; 8 Conclusions and Future Work In WISE, those built-in operations are converted successfully to data source managed by DBMS. WISE also provides a set of visual tools [10] to define data structure, mapping, user operation, etc. WISE can transform those definitions to executable code under the restriction of operation semantics and fulfill database access. There are many works to be done in the future, such as the expression of complex conditions for operations on Web pages, the support of user defined operations, dynamic operation modification, etc. References 1. T. Isakowitz, M. Bieber, F. Vitali. Web Information Systems. Communications of ACM, ACM Press, Vol 41(7) (1998), Peter Barna, et al. Methodologies for Web Information System Design. International Conference on Information Technology: Computers and Communications, (2003) T. Isakowitz, et al. RMM: A methodology for the design of structured hypermedia applications. Communications of ACM, ACM Press, Vol.38(8) (1995) Daniel Schewabe, et al. OOHDM-Web: An Environment for Implementation of Hypermedia Applications in the WWW. ACM SIGWEB Newsletter, Vol.8, Issue2, (1999) J. Foley, et al. UIDE: An Intelligent User Interface Design Environment. In J. Sullivan and S. Tyler (eds), Intelligent User Interfaces, (1991) A. Puerta. The Mecano Project: Comprehensive and Integrated Support for Model-Based Interface Development. Computer-Aided Design of User Interfaces, (1996) Geert-Jan Houben. HERA: Automatically Generating Hypermedia Front-Ends for Ad Hoc Data from Heterogeneous and Legacy Information Systems. In Third International Workshop on Engineering Federated Information Systems, Aka and IOS Press (2000) 8. Ming Xue, Hongyan Li. Managing User Interaction Forms on Web Pages: A Template- Based Approach. Journal(Naturals Science) of Peking University, Vol.40(3) (2004) Jim Challenger, et al. A Publishing System for Efficiently Creating Dynamic Web Data. Proceedings of IEEE INFOCOM Lv-an Tang, Hongyan Li, et al. PODWIS: A Personalized Tool for Ontology Development in Domain Specific Web Information System. APWEB2005, Hongyan Li, et al. An XML Based Electronic Medical Record Integration System. In X. Sean Wang, et al. (eds): WAIM 2001,
CHALLENGES IN ADAPTIVE WEB INFORMATION SYSTEMS: DO NOT FORGET THE LINK!
CHALLENGES IN ADAPTIVE WEB INFORMATION SYSTEMS: DO NOT FORGET THE LINK! GEERT-JAN HOUBEN Technische Universiteit Eindhoven PO Box 513, NL-5600 MB Eindhoven, The Netherlands E-mail: g.j.houben@tue.nl In
More informationMethodologies for Web Information System Design
Methodologies for Web Information System Design Peter Barna, Flavius Frasincar, Geert-Jan Houben, and Richard Vdovjak Technische Universiteit Eindhoven PO Box 53, NL-5600 MB Eindhoven, The Netherlands
More informationA REASONING COMPONENT S CONSTRUCTION FOR PLANNING REGIONAL AGRICULTURAL ADVANTAGEOUS INDUSTRY DEVELOPMENT
A REASONING COMPONENT S CONSTRUCTION FOR PLANNING REGIONAL AGRICULTURAL ADVANTAGEOUS INDUSTRY DEVELOPMENT Yue Fan 1, Yeping Zhu 1*, 1 Agricultural Information Institute, Chinese Academy of Agricultural
More informationConsidering Additional Adaptation Concerns in the Design of Web Applications
Considering Additional Adaptation Concerns in the Design of Web Applications Sven Casteleyn 1, Zoltán Fiala 2, Geert-Jan Houben 1,3, and Kees van der Sluijs 3 1 Vrije Universiteit Brussel, Pleinlaan 2,
More informationImproving Adaptive Hypermedia by Adding Semantics
Improving Adaptive Hypermedia by Adding Semantics Anton ANDREJKO Slovak University of Technology Faculty of Informatics and Information Technologies Ilkovičova 3, 842 16 Bratislava, Slovak republic andrejko@fiit.stuba.sk
More informationA Fast and High Throughput SQL Query System for Big Data
A Fast and High Throughput SQL Query System for Big Data Feng Zhu, Jie Liu, and Lijie Xu Technology Center of Software Engineering, Institute of Software, Chinese Academy of Sciences, Beijing, China 100190
More informationOn Reduct Construction Algorithms
1 On Reduct Construction Algorithms Yiyu Yao 1, Yan Zhao 1 and Jue Wang 2 1 Department of Computer Science, University of Regina Regina, Saskatchewan, Canada S4S 0A2 {yyao, yanzhao}@cs.uregina.ca 2 Laboratory
More informationAssisting Trustworthiness Based Web Services Selection Using the Fidelity of Websites *
Assisting Trustworthiness Based Web Services Selection Using the Fidelity of Websites * Lijie Wang, Fei Liu, Ge Li **, Liang Gu, Liangjie Zhang, and Bing Xie Software Institute, School of Electronic Engineering
More informationDesign Considerations on Implementing an Indoor Moving Objects Management System
, pp.60-64 http://dx.doi.org/10.14257/astl.2014.45.12 Design Considerations on Implementing an s Management System Qian Wang, Qianyuan Li, Na Wang, Peiquan Jin School of Computer Science and Technology,
More informationAdaptive Hypermedia Systems Analysis Approach by Means of the GAF Framework
Adaptive Hypermedia Systems Analysis Approach by Means of the GAF Framework Evgeny Knutov, Paul De Bra, and Mykola Pechenizkiy Department of Computer Science, Eindhoven University of Technology, P.O. Box
More informationAnnotation for the Semantic Web During Website Development
Annotation for the Semantic Web During Website Development Peter Plessers and Olga De Troyer Vrije Universiteit Brussel, Department of Computer Science, WISE, Pleinlaan 2, 1050 Brussel, Belgium {Peter.Plessers,
More informationA Generic Transcoding Tool for Making Web Applications Adaptive
A Generic Transcoding Tool for Making Applications Adaptive Zoltán Fiala 1, Geert-Jan Houben 2 1 Technische Universität Dresden Mommsenstr. 13, D-01062, Dresden, Germany zoltan.fiala@inf.tu-dresden.de
More informationDesign concepts for data-intensive applications
6 th International Conference on Applied Informatics Eger, Hungary, January 27 31, 2004. Design concepts for data-intensive applications Attila Adamkó Department of Information Technology, Institute of
More informationIntroduction to Information Systems
Table of Contents 1... 2 1.1 Introduction... 2 1.2 Architecture of Information systems... 2 1.3 Classification of Data Models... 4 1.4 Relational Data Model (Overview)... 8 1.5 Conclusion... 12 1 1.1 Introduction
More informationFSRM Feedback Algorithm based on Learning Theory
Send Orders for Reprints to reprints@benthamscience.ae The Open Cybernetics & Systemics Journal, 2015, 9, 699-703 699 FSRM Feedback Algorithm based on Learning Theory Open Access Zhang Shui-Li *, Dong
More informationTest Cases Generation from UML Activity Diagrams
Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing Test Cases Generation from UML Activity Diagrams Hyungchoul Kim, Sungwon
More informationUser Interaction in Modern Web Information Systems
Abstract User Interaction in Modern Web Information Systems Peter Barna - Geert-Jan Houben Technische Universiteit Eindhoven PO Box 513, NL-5600 MB Eindhoven, The Netherlands {p.barna, g.j.houben}@tue.nl
More informationRelational Model, Relational Algebra, and SQL
Relational Model, Relational Algebra, and SQL August 29, 2007 1 Relational Model Data model. constraints. Set of conceptual tools for describing of data, data semantics, data relationships, and data integrity
More informationRELATIONAL STORAGE FOR XML RULES
RELATIONAL STORAGE FOR XML RULES A. A. Abd El-Aziz Research Scholar Dept. of Information Science & Technology Anna University Email: abdelazizahmed@auist.net Professor A. Kannan Dept. of Information Science
More information2.3 Algorithms Using Map-Reduce
28 CHAPTER 2. MAP-REDUCE AND THE NEW SOFTWARE STACK one becomes available. The Master must also inform each Reduce task that the location of its input from that Map task has changed. Dealing with a failure
More informationFedX: A Federation Layer for Distributed Query Processing on Linked Open Data
FedX: A Federation Layer for Distributed Query Processing on Linked Open Data Andreas Schwarte 1, Peter Haase 1,KatjaHose 2, Ralf Schenkel 2, and Michael Schmidt 1 1 fluid Operations AG, Walldorf, Germany
More informationSimulating a Finite State Mobile Agent System
Simulating a Finite State Mobile Agent System Liu Yong, Xu Congfu, Chen Yanyu, and Pan Yunhe College of Computer Science, Zhejiang University, Hangzhou 310027, P.R. China Abstract. This paper analyzes
More informationITCS 3160 DATA BASE DESIGN AND IMPLEMENTATION
ITCS 3160 DATA BASE DESIGN AND IMPLEMENTATION JING YANG 2010 FALL Class 3: The Relational Data Model and Relational Database Constraints Outline 2 The Relational Data Model and Relational Database Constraints
More informationHERA: Automatically Generating Hypermedia Front- Ends for Ad Hoc Data from Heterogeneous and Legacy Information Systems
HERA: Automatically Generating Hypermedia Front- Ends for Ad Hoc Data from Heterogeneous and Legacy Information Systems Geert-Jan Houben 1,2 1 Eindhoven University of Technology, Dept. of Mathematics and
More informationCHAPTER 3 Implementation of Data warehouse in Data Mining
CHAPTER 3 Implementation of Data warehouse in Data Mining 3.1 Introduction to Data Warehousing A data warehouse is storage of convenient, consistent, complete and consolidated data, which is collected
More informationSemantic Web Search Model for Information Retrieval of the Semantic Data *
Semantic Web Search Model for Information Retrieval of the Semantic Data * Okkyung Choi 1, SeokHyun Yoon 1, Myeongeun Oh 1, and Sangyong Han 2 Department of Computer Science & Engineering Chungang University
More informationA Tool for Storing OWL Using Database Technology
A Tool for Storing OWL Using Database Technology Maria del Mar Roldan-Garcia and Jose F. Aldana-Montes University of Malaga, Computer Languages and Computing Science Department Malaga 29071, Spain, (mmar,jfam)@lcc.uma.es,
More informationRule Enforcement with Third Parties in Secure Cooperative Data Access
Rule Enforcement with Third Parties in Secure Cooperative Data Access Meixing Le, Krishna Kant, and Sushil Jajodia George Mason University, Fairfax, VA 22030 {mlep,kkant,jajodia}@gmu.edu Abstract. In this
More informationDOPA: A Data-Driven and Ontology-Based Method for Ad Hoc Process Awareness in Web Information Systems
DOPA: A Data-Driven and Ontology-Based Method for Ad Hoc Process Awareness in Web Information Systems Meimei Li, Hongyan Li, Lv-an Tang, and Baojun Qiu National Laboratory on Machine Perception, School
More informationResource Load Balancing Based on Multi-agent in ServiceBSP Model*
Resource Load Balancing Based on Multi-agent in ServiceBSP Model* Yan Jiang 1, Weiqin Tong 1, and Wentao Zhao 2 1 School of Computer Engineering and Science, Shanghai University 2 Image Processing and
More informationA Notation and Framework for Dialog Flow Control in Web Applications
A Notation and Framework for Flow Control in Web Applications Matthias Book and Volker Gruhn Chair of Applied Telematics / e-business, Department of Computer Science University of Leipzig, Klostergasse
More informationModeling Systems Using Design Patterns
Modeling Systems Using Design Patterns Jaroslav JAKUBÍK Slovak University of Technology Faculty of Informatics and Information Technologies Ilkovičova 3, 842 16 Bratislava, Slovakia jakubik@fiit.stuba.sk
More informationMethods for Complex Web Hypermedia Application: The Design Processes
Methods for Complex Web Hypermedia Application: The Design Processes Ahmad Syafiq Ahmad Appandi, Azrul Hazri Jantan Faculty of Computer Science & Information Technology 43400 UPM, Serdang, Selangor. ahmadsyafiq.upm@gmail.com,
More informationHigh Capacity Reversible Watermarking Scheme for 2D Vector Maps
Scheme for 2D Vector Maps 1 Information Management Department, China National Petroleum Corporation, Beijing, 100007, China E-mail: jxw@petrochina.com.cn Mei Feng Research Institute of Petroleum Exploration
More informationWhat is database? Types and Examples
What is database? Types and Examples Visit our site for more information: www.examplanning.com Facebook Page: https://www.facebook.com/examplanning10/ Twitter: https://twitter.com/examplanning10 TABLE
More informationLet s briefly review important EER inheritance concepts
Let s briefly review important EER inheritance concepts 1 is-a relationship Copyright (c) 2011 Pearson Education 2 Basic Constraints Partial / Disjoint: Single line / d in circle Each entity can be an
More informationEssay Question: Explain 4 different means by which constrains are represented in the Conceptual Data Model (CDM).
Question 1 Essay Question: Explain 4 different means by which constrains are represented in the Conceptual Data Model (CDM). By specifying participation conditions By specifying the degree of relationship
More informationData Manipulation (DML) and Data Definition (DDL)
Data Manipulation (DML) and Data Definition (DDL) 114 SQL-DML Inserting Tuples INSERT INTO REGION VALUES (6,'Antarctica','') INSERT INTO NATION (N_NATIONKEY, N_NAME, N_REGIONKEY) SELECT NATIONKEY, NAME,
More informationHypermedia Presentation Adaptation on the Semantic Web
Hypermedia Presentation Adaptation on the Semantic Web Flavius Frasincar and Geert-Jan Houben Eindhoven University of Technology PO Box 513, NL-5600 MB Eindhoven, The Netherlands {flaviusf, houben}@win.tue.nl
More informationA UML-based Methodology for Hypermedia Design
A UML-based Methodology for Hypermedia Design Rolf Hennicker, Nora Koch,2 Institute of Computer Science Ludwig-Maximilians University of Munich Oettingenstr. 67, D-80538 München, Germany {hennicke,kochn}@informatik.uni-muenchen.de
More informationIntro to Transaction Management
Intro to Transaction Management CMPSCI 645 May 3, 2006 Gerome Miklau Slide content adapted from Ramakrishnan & Gehrke, Zack Ives 1 Concurrency Control Concurrent execution of user programs is essential
More informationIntroduction to Transaction Management
Introduction to Transaction Management CMPSCI 645 Apr 1, 2008 Slide content adapted from Ramakrishnan & Gehrke, Zack Ives 1 Concurrency Control Concurrent execution of user programs is essential for good
More informationModelling of Adaptive Hypermedia Systems
Modelling of Adaptive Hypermedia Systems Martin Balík, Ivan Jelínek Abstract: The amount of information on the web is permanently growing. The orientation within the information is becoming more and more
More informationThe Application Research of Semantic Web Technology and Clickstream Data Mart in Tourism Electronic Commerce Website Bo Liu
International Conference on Education Technology, Management and Humanities Science (ETMHS 2015) The Application Research of Semantic Web Technology and Clickstream Data Mart in Tourism Electronic Commerce
More informationTowards a High Integrity XML Link Update in Object-Relational Database
Towards a High Integrity XML Link Update in Object-Relational Database Eric Pardede, J. Wenny Rahayu, and David Taniar Department of Computer Science and Computer Engineering, La Trobe University, undoora
More informationUnderstanding Impact of J2EE Applications On Relational Databases. Dennis Leung, VP Development Oracle9iAS TopLink Oracle Corporation
Understanding Impact of J2EE Applications On Relational Databases Dennis Leung, VP Development Oracle9iAS TopLink Oracle Corporation J2EE Apps and Relational Data J2EE is one of leading technologies used
More informationImplementation Issues on OHS-based Workflow Services
Implementation Issues on OHS-based Workflow Services Abstract Weigang Wang and Jörg M. Haake GMD - German National Research Center for Information Technology IPSI - Publication and Information Systems
More informationMicrosoft Office Access 2007: Intermediate Course 01 Relational Databases
Microsoft Office Access 2007: Intermediate Course 01 Relational Databases Slide 1 Relational Databases Course objectives Normalize tables Set relationships between tables Implement referential integrity
More informationDesign and Implementation of an Anycast Efficient QoS Routing on OSPFv3
Design and Implementation of an Anycast Efficient QoS Routing on OSPFv3 Han Zhi-nan Yan Wei Zhang Li Wang Yue Computer Network Laboratory Department of Computer Science & Technology, Peking University
More informationRelational Data Model
Relational Data Model 1. Relational data model Information models try to put the real-world information complexity in a framework that can be easily understood. Data models must capture data structure
More informationAn Approach for Extracting UML Diagram from Object-Oriented Program Based on J2X Haoqing Zhang1,a
International Forum on Mechanical, Control and Automation (IFMCA 2016) An Approach for Extracting UML Diagram from Object-Oriented Program Based on J2X Haoqing Zhang1,a 1 School of Computer Science and
More informationThe Research on the Method of Process-Based Knowledge Catalog and Storage and Its Application in Steel Product R&D
The Research on the Method of Process-Based Knowledge Catalog and Storage and Its Application in Steel Product R&D Xiaodong Gao 1,2 and Zhiping Fan 1 1 School of Business Administration, Northeastern University,
More informationTHE TASK-TO-PRESENTATION-DIALOG MAPPING PROBLEM
THE TSK-TO-PRESENTTION-LOG MPNG PROBLEM Quentin Limbourg and Jean Vanderdonckt Université catholique de Louvain, Place des Doyens, 1 B-1348 Louvain-la-Neuve, Belgium {Limbourg, Vanderdonckt}@isys.ucl.ac.be
More informationOntology Transformation in Multiple Domains
Ontology Transformation in Multiple Domains Longbing Cao 1, Dan Luo 2, Chao Luo 3, Li Liu 4 1,4 Faculty of Information Technology, University of Technology Sydney, Australia 2,3 Department of Electronics
More informationQuerying Data with Transact SQL
Course 20761A: Querying Data with Transact SQL Course details Course Outline Module 1: Introduction to Microsoft SQL Server 2016 This module introduces SQL Server, the versions of SQL Server, including
More informationTowards a Global Component Architecture for Learning Objects: An Ontology Based Approach
Towards a Global Component Architecture for Learning Objects: An Ontology Based Approach Katrien Verbert, Joris Klerkx, Michael Meire, Jehad Najjar, and Erik Duval Dept. Computerwetenschappen, Katholieke
More informationResource and Service Trading in a Heterogeneous Large Distributed
Resource and Service Trading in a Heterogeneous Large Distributed ying@deakin.edu.au Y. Ni School of Computing and Mathematics Deakin University Geelong, Victoria 3217, Australia ang@deakin.edu.au Abstract
More informationAutomation of Semantic Web based Digital Library using Unified Modeling Language Minal Bhise 1 1
Automation of Semantic Web based Digital Library using Unified Modeling Language Minal Bhise 1 1 Dhirubhai Ambani Institute for Information and Communication Technology, Gandhinagar, Gujarat, India Email:
More informationTransforming UML State Machines into Stochastic Petri Nets for Energy Consumption Estimation of Embedded Systems
Transforming UML State Machines into Stochastic Petri Nets for Energy Consumption Estimation of Embedded Systems Dmitriy Shorin and Armin Zimmermann Ilmenau University of Technology System & Software Engineering
More informationIMPERATIVE PROGRAMS BEHAVIOR SIMULATION IN TERMS OF COMPOSITIONAL PETRI NETS
IMPERATIVE PROGRAMS BEHAVIOR SIMULATION IN TERMS OF COMPOSITIONAL PETRI NETS Leontyev Denis Vasilevich, Kharitonov Dmitry Ivanovich and Tarasov Georgiy Vitalievich ABSTRACT Institute of Automation and
More informationDatabase Management System Dr. S. Srinath Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No.
Database Management System Dr. S. Srinath Department of Computer Science & Engineering Indian Institute of Technology, Madras Lecture No. # 5 Structured Query Language Hello and greetings. In the ongoing
More informationA Finite State Mobile Agent Computation Model
A Finite State Mobile Agent Computation Model Yong Liu, Congfu Xu, Zhaohui Wu, Weidong Chen, and Yunhe Pan College of Computer Science, Zhejiang University Hangzhou 310027, PR China Abstract In this paper,
More informationEnterprise Planning Model Using REA Ontology
Enterprise Planning Model Using REA Ontology Frantisek Hunka 1, Miroslav Hucka 2, Josef Kasik 2, Dominik Vymetal 3 1 University of Ostrava, Dvorakova 7, 701 03 Ostrava 1, Czech Republic, frantisek.hunka@osu.cz
More informationA Data warehouse within a Federated database architecture
Association for Information Systems AIS Electronic Library (AISeL) AMCIS 1997 Proceedings Americas Conference on Information Systems (AMCIS) 8-15-1997 A Data warehouse within a Federated database architecture
More informationCS 2451 Database Systems: Relational Data Model
CS 2451 Database Systems: Relational Data Model http://www.seas.gwu.edu/~bhagiweb/cs2541 Spring 2018 Instructor: Dr. Bhagi Narahari Lead TA: Roxana Leontie TA/Grader: Malik Undergrad TA: Victoria Zheng
More informationLearning the Three Factors of a Non-overlapping Multi-camera Network Topology
Learning the Three Factors of a Non-overlapping Multi-camera Network Topology Xiaotang Chen, Kaiqi Huang, and Tieniu Tan National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy
More informationUnifying Adaptive Learning Environments: authoring styles in the GRAPPLE project
Unifying Adaptive Learning Environments: authoring styles in the GRAPPLE project Paul De Bra, David Smits, Evgeny Knutov, Eva Ploum, Kees van der Sluijs Eindhoven University of Technology, Department of
More informationPersonal Grid. 1 Introduction. Zhiwei Xu, Lijuan Xiao, and Xingwu Liu
Personal Grid Zhiwei Xu, Lijuan Xiao, and Xingwu Liu Institute of Computing Technology, Chinese Academy of Sciences 100080 Beijing, China Abstract. A long-term trend in computing platform innovation is
More informationPayola: Collaborative Linked Data Analysis and Visualization Framework
Payola: Collaborative Linked Data Analysis and Visualization Framework Jakub Klímek 1,2,Jiří Helmich 1, and Martin Nečaský 1 1 Charles University in Prague, Faculty of Mathematics and Physics Malostranské
More informationSQL Interview Questions
SQL Interview Questions SQL stands for Structured Query Language. It is used as a programming language for querying Relational Database Management Systems. In this tutorial, we shall go through the basic
More informationFast and Effective Interpolation Using Median Filter
Fast and Effective Interpolation Using Median Filter Jian Zhang 1, *, Siwei Ma 2, Yongbing Zhang 1, and Debin Zhao 1 1 Department of Computer Science, Harbin Institute of Technology, Harbin 150001, P.R.
More informationClean Living: Eliminating Near-Duplicates in Lifetime Personal Storage
Clean Living: Eliminating Near-Duplicates in Lifetime Personal Storage Zhe Wang Princeton University Jim Gemmell Microsoft Research September 2005 Technical Report MSR-TR-2006-30 Microsoft Research Microsoft
More informationAnalysing the navigational aspect
A. M. Reina Dpto. Lenguajes y Sistemas Informáticos Universidad de Sevilla. e-mail: reinaqu@lsi.us.es Analysing the navigational aspect J. Torres Dpto. Lenguajes y Sistemas Informáticos Universidad de
More informationA REUSE METHOD OF MECHANICAL PRODUCT DEVELOPMENT KNOWLEDGE BASED ON CAD MODEL SEMANTIC MARKUP AND RETRIEVAL
A REUSE METHOD OF MECHANICAL PRODUCT DEVELOPMENT KNOWLEDGE BASED ON CAD MODEL SEMANTIC MARKUP AND RETRIEVAL Qinyi MA*, Lu MENG, Lihua SONG, Peng XUE, Maojun ZHOU, Yajun WANG Department of Mechanical Engineering,
More informationGeneric and Domain Specific Ontology Collaboration Analysis
Generic and Domain Specific Ontology Collaboration Analysis Frantisek Hunka, Steven J.H. van Kervel 2, Jiri Matula University of Ostrava, Ostrava, Czech Republic, {frantisek.hunka, jiri.matula}@osu.cz
More informationConstructing Control Flow Graph for Java by Decoupling Exception Flow from Normal Flow
Constructing Control Flow Graph for Java by Decoupling Exception Flow from Normal Flow Jang-Wu Jo 1 and Byeong-Mo Chang 2 1 Department of Computer Engineering Pusan University of Foreign Studies Pusan
More informationI will not use a source other than my brain on this exam: (please sign)
Final Exam (CS 265 47 points Name: KEY I will not use a source other than my brain on this exam: (please sign 1. (2 pts Consider CAREFULLY the following table definitions. Remember that these definitions
More informationASGRT Automated Report Generation System
ASGRT Automated Report Generation System Dejan Gjorgjevikj, Gjorgji Madjarov, Ivan Chorbev, Martin Angelovski, Marjan Georgiev, and Bojan Dikovski University Ss Cyril and Methodius, Faculty of electrical
More informationAn Annotation Tool for Semantic Documents
An Annotation Tool for Semantic Documents (System Description) Henrik Eriksson Dept. of Computer and Information Science Linköping University SE-581 83 Linköping, Sweden her@ida.liu.se Abstract. Document
More informationMaking Semantic Web based-hypermedia Applications
Making Semantic Web based-hypermedia Applications Laura Montells, Susana Montero, Paloma Díaz, Ignacio Aedo Laboratorio DEI. Dpto. de Informática Universidad Carlos III de Madrid Avda. de la Universidad
More informationMinimal Test Cost Feature Selection with Positive Region Constraint
Minimal Test Cost Feature Selection with Positive Region Constraint Jiabin Liu 1,2,FanMin 2,, Shujiao Liao 2, and William Zhu 2 1 Department of Computer Science, Sichuan University for Nationalities, Kangding
More informationBehaviour Recovery and Complicated Pattern Definition in Web Usage Mining
Behaviour Recovery and Complicated Pattern Definition in Web Usage Mining Long Wang and Christoph Meinel Computer Department, Trier University, 54286 Trier, Germany {wang, meinel@}ti.uni-trier.de Abstract.
More informationProgramming the Semantic Web
Programming the Semantic Web Steffen Staab, Stefan Scheglmann, Martin Leinberger, Thomas Gottron Institute for Web Science and Technologies, University of Koblenz-Landau, Germany Abstract. The Semantic
More informationLab IV. Transaction Management. Database Laboratory
Lab IV Transaction Management Database Laboratory Objectives To work with transactions in ORACLE To study the properties of transactions in ORACLE Database integrity must be controlled when access operations
More informationQuery Rewriting Using Views in the Presence of Inclusion Dependencies
Query Rewriting Using Views in the Presence of Inclusion Dependencies Qingyuan Bai Jun Hong Michael F. McTear School of Computing and Mathematics, University of Ulster at Jordanstown, Newtownabbey, Co.
More informationXML Systems & Benchmarks
XML Systems & Benchmarks Christoph Staudt Peter Chiv Saarland University, Germany July 1st, 2003 Main Goals of our talk Part I Show up how databases and XML come together Make clear the problems that arise
More informationAuto-Generating Test Sequences for Web Applications *
Auto-Generating Test Sequences for Web Applications * Hongwei Zeng and Huaikou Miao School of Computer Engineering and Science, Shanghai University, 200072, China zenghongwei@shu.edu.cn, hkmiao@shu.edu.cn
More informationStudy on XML-based Heterogeneous Agriculture Database Sharing Platform
Study on XML-based Heterogeneous Agriculture Database Sharing Platform Qiulan Wu, Yongxiang Sun, Xiaoxia Yang, Yong Liang,Xia Geng School of Information Science and Engineering, Shandong Agricultural University,
More informationOn the Maximum Throughput of A Single Chain Wireless Multi-Hop Path
On the Maximum Throughput of A Single Chain Wireless Multi-Hop Path Guoqiang Mao, Lixiang Xiong, and Xiaoyuan Ta School of Electrical and Information Engineering The University of Sydney NSW 2006, Australia
More informationAn Extensible Use Case Modeling Approach for Cyber- Physical Systems (CPSs)
An Extensible Use Case Modeling Approach for Cyber- Physical Systems (CPSs) Gong Zhang 1, Tao Yue 2, Shaukat Ali 2 and Ji Wu 1 1 School of Computer Science and Engineering, Beihang University, Beijing,
More informationAuthoring Multi-device Web Applications with Database Access
Authoring Multi-device Web Applications with Database Access Giulio Mori, Fabio Paternò, and Carmen Santoro ISTI-CNR, Via Moruzzi 1, 56126 Pisa, Italy {Giulio.Mori, Fabio.Paterno, Carmen.Santoro}@isti.cnr.it
More informationDATA AND SCHEMA MODIFICATIONS CHAPTERS 4,5 (6/E) CHAPTER 8 (5/E)
1 DATA AND SCHEMA MODIFICATIONS CHAPTERS 4,5 (6/E) CHAPTER 8 (5/E) 2 LECTURE OUTLINE Updating Databases Using SQL Specifying Constraints as Assertions and Actions as Triggers Schema Change Statements in
More informationReview -Chapter 4. Review -Chapter 5
Review -Chapter 4 Entity relationship (ER) model Steps for building a formal ERD Uses ER diagrams to represent conceptual database as viewed by the end user Three main components Entities Relationships
More informationSpecification of web applications design in CASE using UML and its mapping to an implementation environment
Specification of web applications design in CASE using UML and its mapping to an implementation environment Peter Blšták * peter.blstak@softec.sk Mária Bieliková ** bielik@fiit.stuba.sk Abstract: Software
More informationThe Submission Data File System Automating the Creation of CDISC SDTM and ADaM Datasets
Paper AD-08 The Submission Data File System Automating the Creation of CDISC SDTM and ADaM Datasets Marcus Bloom, Amgen Inc, Thousand Oaks, CA David Edwards, Amgen Inc, Thousand Oaks, CA ABSTRACT From
More informationAn RDF NetAPI. Andy Seaborne. Hewlett-Packard Laboratories, Bristol
An RDF NetAPI Andy Seaborne Hewlett-Packard Laboratories, Bristol andy_seaborne@hp.com Abstract. This paper describes some initial work on a NetAPI for accessing and updating RDF data over the web. The
More informationA Framework for Enforcing Constrained RBAC Policies
A Framework for Enforcing Constrained RBAC Policies Jason Crampton Information Security Group Royal Holloway, University of London jason.crampton@rhul.ac.uk Hemanth Khambhammettu Information Security Group
More informationTHE RELATIONAL DATABASE MODEL
THE RELATIONAL DATABASE MODEL Introduction to relational DB Basic Objects of relational model Properties of relation Representation of ER model to relation Keys Relational Integrity Rules Functional Dependencies
More informationA ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DELAY-TOLERANT NETWORKS
A ROUTING MECHANISM BASED ON SOCIAL NETWORKS AND BETWEENNESS CENTRALITY IN DELAY-TOLERANT NETWORKS ABSTRACT Zhang Huijuan and Liu Kai School of Software Engineering, Tongji University, Shanghai, China
More informationAn Intelligent Retrieval Platform for Distributional Agriculture Science and Technology Data
An Intelligent Retrieval Platform for Distributional Agriculture Science and Technology Data Xiaorong Yang 1,2, Wensheng Wang 1,2, Qingtian Zeng 3, and Nengfu Xie 1,2 1 Agriculture Information Institute,
More information