Filters








234 Hits in 3.4 sec

Algorithms and programming models for efficient representation of XML for Internet applications

Neel Sundaresan, Reshad Moussa
2001 Proceedings of the tenth international conference on World Wide Web - WWW '01  
In this paper we describe some of the newer algorithms and APIs in our system for compression of XML structures and data.  ...  Our compression algorithms, in addition to separating structure and text for compression, take advantage of the associated schema (if available) in compressing the structure.  ...  For example, WBXML preserves the element structure of XML, allowing a browser to skip unknown elements or attributes.  ... 
doi:10.1145/371920.372090 dblp:conf/www/SundaresanM01 fatcat:hsw5ckq24zaojh2j7kbnyt3o7a

Algorithms and programming models for efficient representation of XML for Internet applications

Neel Sundaresan, Reshad Moussa
2002 Computer Networks  
In this paper we describe some of the newer algorithms and APIs in our system for compression of XML structures and data.  ...  Our compression algorithms, in addition to separating structure and text for compression, take advantage of the associated schema (if available) in compressing the structure.  ...  For example, WBXML preserves the element structure of XML, allowing a browser to skip unknown elements or attributes.  ... 
doi:10.1016/s1389-1286(02)00224-4 fatcat:lxxwe6mmzncdrhk3d7yv2isik4

Managing XML by the Nested Relational Sequence Database System [chapter]

Ho-Lam Lau, Wilfred Ng
2003 Lecture Notes in Computer Science  
In this paper, we demonstrate NRS operations by examples and illustrate how XML queries can be formulated.  ...  We have established the Nested Relational Sequence Model (NRSM), which is an extension of the Nested Relational Data Model in order to handle XML data.  ...  The NRSM preserves the original structure of XML documents, in general, they can be retrieved from NRS relations without loss of information.  ... 
doi:10.1007/978-3-540-45160-0_13 fatcat:mc4r2ytrtvfjfg3arwt3jd3jxu

Updating Recursive XML Views of Relations

Byron Choi, Gao Cong, Wenfei Fan, Stratis D. Viglas
2008 Journal of Computer Science and Technology  
We consider XML views defined in terms of mappings directed by possibly recursive DTDs, compressed into DAGs and stored in relations.  ...  The interaction between XPath recursion and DAG compression of XML views makes the analysis of XML view updates rather intriguing.  ...  DAG compression of XML views.  ... 
doi:10.1007/s11390-008-9150-y fatcat:jtb6vthgrjeyzndskv7rfupb7u

Updating Recursive XML Views of Relations

Byron Choi, Gao Cong, Wenfei Fan, Stratis D. Viglas
2007 2007 IEEE 23rd International Conference on Data Engineering  
We consider XML views defined in terms of mappings directed by possibly recursive DTDs, compressed into DAGs and stored in relations.  ...  The interaction between XPath recursion and DAG compression of XML views makes the analysis of XML view updates rather intriguing.  ...  DAG compression of XML views.  ... 
doi:10.1109/icde.2007.367922 dblp:conf/icde/ChoiCFV07 fatcat:pmr2pyjmqbdabkqjeyef7ugoxq

DTD-Directed Publishing with Attribute Translation Grammars [chapter]

Michael Benedikt, Chee Yong Chan, Wenfei Fan, Rajeev Rastogi, Shihui Zheng, Aoying Zhou
2002 VLDB '02: Proceedings of the 28th International Conference on Very Large Databases  
We present a framework for publishing relational data in XML with respect to a fixed DTD.  ...  In data exchange on the Web, XML views of relational data are typically required to conform to a predefined DTD.  ...  An XML tree Ì conforms to a DTD if its structure is constrained by as follows: (1) there is a unique node in Ì labeled with Ö, namely, the root; (2) each node in Ì is labeled either with an element type  ... 
doi:10.1016/b978-155860869-6/50079-2 dblp:conf/vldb/BenediktCFRZZ02 fatcat:clgmzoghardyfm3tdkewolloh4

Optimization and Refinement of XML Schema Inference Approaches

Michal Klempa, Jakub Stárka, Irena Mlynková
2012 Procedia Computer Science  
XML is a widely used technology.  ...  Although in most real life applications XML data is required to conform to particular schemas, the majority of real-world XML documents does not contain any explicit declaration.  ...  To enforce a defined structure of XML documents, one can use XML schema definition languages such as DTD [1] , or XSD [2] .  ... 
doi:10.1016/j.procs.2012.06.019 fatcat:jvwcwhbturapxei2t2hjcus2mu

NISO Z39.96 The Journal Article Tag Suite (JATS): What Happened to the NLM DTDs?

Jeffrey Beck
2011 Journal of Electronic Publishing  
The "&" operator was removed from XML, so an alternate structure must be used in an XML DTD.  ...  EPS is a widely used format that also has excellent compression properties, however rather than being a simple bitmap format, it is a complex object-based format driven by the proprietary PostScript language  ...  Some content may be more difficult to convert from one publisher's DTD to an archiving DTD due to how the same structural element may be handled differently in DTDs. 3.  ... 
doi:10.3998/3336451.0014.106 pmid:22140303 pmcid:PMC3227009 fatcat:ugq7dqfiqzbs5mb2oqqnr4grye

XQueC

Andrei Arion, Angela Bonifati, Ioana Manolescu, Andrea Pugliese
2007 ACM Transactions on Internet Technology  
Query execution in the compressed domain must also be rethought in the framework of XML query processing due to the richer structure of XML data.  ...  XML compression has gained prominence recently because it counters the disadvantage of the verbose representation XML gives to data.  ...  Finally, XCQ ] uses DTDs to perform compression and subsequent querying of XML documents.  ... 
doi:10.1145/1239971.1239974 fatcat:tbtkhqvbavh2josru43zvzokjm

Linguistic documents synchronizing sound and text

Michel Jacobson, Boyd Michailovsky, John B. Lowe
2001 Speech Communication  
The project uses simple, TEI-inspired XML markup for the kinds of annotation traditionally used in field linguistics.  ...  Marked-up data is processed using widely-available XML/XSL/XQL software tools, and displayed using standard browsers.  ...  The structural properties of an XML document or of a class of such documents can be declared in a Document Type Declaration (DTD).  ... 
doi:10.1016/s0167-6393(00)00070-4 fatcat:aq23phixvngcldtmlnjs6x4v5y

Interoperability mapping from XML schemas to ER diagrams

Giuseppe Della Penna, Antinisca Di Marco, Benedetto Intrigila, Igor Melatti, Alfonso Pierantonio
2006 Data & Knowledge Engineering  
At the present, the best solution for storing XML into pre-existing data structures is to extract the information from the XML documents and adapt it to the data structures' logical model (e.g., the relational  ...  The eXtensible Markup Language (XML) is a de facto standard on the Internet and is now being used to exchange a variety of data structures.  ...  We decided to adopt XML Schemas [11] rather than DTDs [1] as the starting point of our mapping since DTDs are being progressively replaced by XML Schemas, especially when XML is used to hold data structures  ... 
doi:10.1016/j.datak.2005.08.002 fatcat:vdxxlimndffn3phvntml6ezisq

Heuristic Methods for Inference of XML Schemas: Lessons Learned and Open Issues

Irena MLÝNKOVÁ, Martin NECASKÝ
2013 Informatica  
In this paper we focus on a specific class of XML schema inference approaches -so-called heuristic approaches.  ...  To enable users to specify own allowed structure of XML documents, so-called XML schema, the W3C 1 has proposed two languages -DTD (Bray et al., 2008) and XML Schema (Thompson et al., 2004; Biron and  ...  Our motivation results from ideas used in adaptive schema-driven XML-to-relational mapping strategies.  ... 
doi:10.15388/informatica.2013.05 fatcat:ammhwo7otneophyngo6nn5q6vm

Efficiently Querying Large XML Data Repositories: A Survey

Gang Gou, Rada Chirkova
2007 IEEE Transactions on Knowledge and Data Engineering  
Index Terms-XML query processing, twig pattern matching.  ...  One important problem in XML query processing is twig pattern matching, that is, finding in an XML data tree D all matches that satisfy a specified twig (or path) query pattern Q.  ...  Its basic idea is compressing an XML data graph G into a (smaller) index graph G I so that XML queries can be more efficiently evaluated over G I rather than over G.  ... 
doi:10.1109/tkde.2007.1060 fatcat:kzmwqcla6rfyvakf4ctc5dwlwm

An Introduction to DEVS Standardization [chapter]

Gabriel Wainer, Khaldoon Al-Zoubi, David Hill, Saurabh Mittal, José Martín, Hessam Sarjoughian, Luc Touraille, Mamadou Traoré, Bernard Zeigler
2010 Computational Analysis, Synthesis, & Design Dynamic Systems  
., XML) in order to share model information and make a step towards model interoperability and reuse.  ...  We also presented a discussion of different representation designs, including DEVS/XML, DEVSML, XFD-DEVS, DEVS/SCXML, DML, and CoSMoS.  ...  XML Schema In 2001, the W3C developed a new schema to overcome the DTD shortcomings. This schema is also named XML (which is confusing since DTDs are also XML).  ... 
doi:10.1201/b10412-21 fatcat:m5xsstng6zdgrox65i27hmjotm

Binary XML storage and query processing in Oracle 11g

Ning Zhang, Nipun Agarwal, Sivasankaran Chandrasekar, Sam Idicula, Vijay Medi, Sabina Petride, Balasubramanyam Sthanikam
2009 Proceedings of the VLDB Endowment  
We further optimize query processing by exploiting XML structural and schema information that are collected in database dictionary.  ...  However, both storage formats have intrinsic limitations-XML/CLOB has unacceptable query and update performance, and XML/OR requires XML schema.  ...  The focus of EFX is on superior compression ratio based on XML schema or structural information. The motivation of EFX is to be able to transfer XML data efficiently over the network.  ... 
doi:10.14778/1687553.1687561 fatcat:ascxbhkojnhflauewvlmeetqf4
« Previous Showing results 1 — 15 out of 234 results