• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 220
  • 16
  • 15
  • 10
  • 10
  • 3
  • 3
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 330
  • 298
  • 249
  • 231
  • 156
  • 82
  • 61
  • 54
  • 52
  • 47
  • 47
  • 44
  • 40
  • 35
  • 32
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
71

Semistructured and structured data manipulation.

January 2001 (has links)
by Kuo Yin-Hung. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 91-97). / Abstracts in English and Chinese. / Abstract --- p.ii / Acknowledgments --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Web Document Classification --- p.3 / Chapter 1.2 --- Web Document Integration --- p.5 / Chapter 1.3 --- Dictionary and Incremental Update --- p.5 / Chapter 1.4 --- IR-Tree --- p.6 / Chapter 1.5 --- Thesis Overview --- p.7 / Chapter 2 --- Related Works --- p.9 / Chapter 2.1 --- Semi-structured Data and OEM --- p.9 / Chapter 2.1.1 --- Semi-structured Data --- p.9 / Chapter 2.1.2 --- Object Exchange Model --- p.10 / Chapter 2.2 --- Related Work on Web Document Partitioning --- p.11 / Chapter 2.2.1 --- Retrieval of Authoritatives --- p.12 / Chapter 2.2.2 --- Document Categorization Methodology --- p.13 / Chapter 2.3 --- Semi-structured Data Indexing --- p.14 / Chapter 2.3.1 --- Lore --- p.14 / Chapter 2.3.2 --- Tsimmis --- p.15 / Chapter 2.3.3 --- Other Algorithms --- p.15 / Chapter 2.4 --- Related Work on SAMs --- p.15 / Chapter 2.4.1 --- R-Tree and R*-Tree --- p.16 / Chapter 2.4.2 --- SS-Tree and SR-Tree --- p.16 / Chapter 2.4.3 --- TV-Tree and X-Tree --- p.18 / Chapter 2.5 --- Clustering Algorithms --- p.18 / Chapter 2.5.1 --- DBSCAN and Incremental-DBSCAN --- p.20 / Chapter 3 --- Web Document Classification --- p.21 / Chapter 3.1 --- Basic Definitions --- p.21 / Chapter 3.2 --- Similarity Computation --- p.26 / Chapter 3.2.1 --- Structural Transformation --- p.27 / Chapter 3.2.2 --- Node Similarity --- p.29 / Chapter 3.2.3 --- Edge Label Similarity --- p.30 / Chapter 3.2.4 --- Structural Similarity --- p.31 / Chapter 3.2.5 --- Overall Similarity --- p.32 / Chapter 3.2.6 --- Representative Selection --- p.33 / Chapter 3.3 --- Incremental Update --- p.34 / Chapter 3.3.1 --- Documents related to a subset --- p.35 / Chapter 3.3.2 --- Documents unrelated to any subset --- p.35 / Chapter 3.3.3 --- Documents linking up two or more subsets --- p.35 / Chapter 3.4 --- Experimental Results --- p.36 / Chapter 3.4.1 --- Compare with K-NN --- p.36 / Chapter 3.4.2 --- Representative vs Feature Vector --- p.38 / Chapter 4 --- Web Document Integration --- p.40 / Chapter 4.1 --- Structure Borrowing --- p.40 / Chapter 4.2 --- Integration of Seeds --- p.42 / Chapter 4.3 --- Incremental Update --- p.48 / Chapter 4.3.1 --- New OEM record is a normal record --- p.49 / Chapter 4.3.2 --- New record is a potential seed --- p.50 / Chapter 5 --- Dictionary --- p.51 / Chapter 5.1 --- Structure of a Dictionary Entry --- p.52 / Chapter 5.2 --- Dictionary: Relation Identifier --- p.54 / Chapter 5.3 --- Dictionary: Complement of Representative --- p.55 / Chapter 5.4 --- Incremental Update --- p.56 / Chapter 5.5 --- Experimental Result --- p.57 / Chapter 5.5.1 --- Search based on keyword --- p.57 / Chapter 5.5.2 --- Search by submitting ambiguous words --- p.58 / Chapter 5.5.3 --- Retrieval of related words --- p.59 / Chapter 6 --- Structured Data Manipulation: IR-Tree --- p.61 / Chapter 6.1 --- Range Search vs Nearest Neighbor Search --- p.61 / Chapter 6.2 --- Why R*-Tree and Incremental-DBSCAN? --- p.63 / Chapter 6.3 --- IR-Tree: The Integration of Clustering and Indexing --- p.64 / Chapter 6.3.1 --- Index Structure --- p.64 / Chapter 6.3.2 --- Insertion of IR-Tree --- p.66 / Chapter 6.3.3 --- Deletion on IR-tree --- p.68 / Chapter 6.3.4 --- Nearest Neighbor Search --- p.69 / Chapter 6.3.5 --- Discussion on IR-Tree --- p.73 / Chapter 6.4 --- Experimental Results --- p.73 / Chapter 6.4.1 --- General knn-search performance --- p.74 / Chapter 6.4.2 --- Performance on Varying Dimensionality and Distribution --- p.76 / Chapter 7 --- IM-Tree: An Review --- p.80 / Chapter 7.1 --- Indexing Techniques on Metric Space --- p.80 / Chapter 7.1.1 --- Definition --- p.81 / Chapter 7.1.2 --- Metric Space Indexing Algorithms --- p.81 / Chapter 7.2 --- Clustering Algorithms on Metric Space --- p.83 / Chapter 7.3 --- The Integration of Clustering and Metric-Space Indexing Algorithm --- p.84 / Chapter 7.4 --- Proposed Algorithm --- p.85 / Chapter 7.4.1 --- Index Structure --- p.85 / Chapter 7.4.2 --- Nearest Neighbor Search --- p.86 / Chapter 7.5 --- Future Works --- p.86 / Chapter 8 --- Conclusion and Future Works --- p.87 / Chapter 8.1 --- Semi-structured Data Manipulation --- p.88 / Chapter 8.2 --- Structured Data Manipulation --- p.89
72

Updating Views Over Recursive XML

Jiang, Ming 06 January 2008 (has links)
We study the problem of updating XML views defined over XML documents. A view update is performed by finding the base updates over the underlying data sources that achieve the desired view update. If such base updates do not exist, the view update is said to be untranslatable and rejected. In SQL, determining whether a view update is translatable is performed using schema level analysis, where the view definition and the base schema are used. XML schemas are more complex than SQL schemas, and can specify recursive types and cardinality constraints. There are two kinds of view updates: single view element update, where the user requires for an update over a particular view element, and a set of view elements update, where the user requires for an update over all view elements that satisfy a given XPath over the view. Accordingly, we propose one solution for each kind of view update problems based on schema level analysis for determining whether an update over XML views is translatable and for finding the translation if one exists, while considering the features of XML schemas.
73

Poder de mercado, escala e a produtividade da indústria brasileira entre 1994 e 2007

Clezar, Rômulo Viana 12 March 2010 (has links)
Made available in DSpace on 2015-03-05T18:58:03Z (GMT). No. of bitstreams: 0 Previous issue date: 12 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / O presente trabalho visa estudar a produtividade da indústria de transformação brasileira e seu comportamento diante de choques estruturais ou conjunturais no período de 1994 a 2007. Para tanto, apresenta-se um modelo capaz de estimar o poder de mercado e a escala de produção com o que se torna possível medir a produtividade total de fatores em concorrência imperfeita. A análise realizada para o conjunto da indústria indica elevado poder de mercado até 1999 e aumento significativo após a mudança de regime cambial. Para o conjunto da indústria são identificados retornos decrescentes de escala entre 1996 e 1998, retornos crescentes de 1999 até 2002 e novamente retornos decrescentes entre 2003 e 2007. Contudo, não foi possível apontar em quais setores as quebras de estrutura são significativas. A produtividade mostrou elevado crescimento em 1999 e taxas negativas após 2003. / This work focuses on the time path of productivity in the Brazilian manufacturing sector and its behavior in the face of structural shocks during the period 1994 to 2007. It presents a model that is capable of estimating the market power and scale effects in order to measure the total factor productivity under imperfect competition. The analysis for the entire industry indicates a high degree of market power by 1999 and a significant increase in it after the change of the exchange rate regime. Also, for the entire industry, decreasing returns to scale are identified between 1996 and 1998, followed by increasing returns from 1999 to 2002 and, again diminishing returns between 2003 and 2007. However, it was not possible to identify sectors in which the structural shocks were significant. The productivity showed high growth rates in 1999 and negative rates after 2003.
74

Schema extraction for semi-structured data. / CUHK electronic theses & dissertations collection

January 2002 (has links)
by Qiuyue Wang. / "July 2002." / Thesis (Ph.D.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (p. 74-82). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web.
75

The structured-element object model for XML.

January 2003 (has links)
Ma Chak Kei. / Thesis submitted in: July 2002. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 97-101). / Abstracts in English and Chinese. / ABSTRACT --- p.II / ACKNOWLEDGEMENTS --- p.VI / TABLE OF CONTENTS --- p.VII / LIST OF TABLES --- p.XI / LIST OF FIGURES --- p.XIII / Chapter CHAPTER 1. --- INTRODUCTION --- p.1 / Chapter 1.1 --- Addressing and Manipulating XML Data --- p.1 / Chapter 1.2 --- The Structured-Element Object Model (SEOM) --- p.3 / Chapter 1.3 --- Relate Research --- p.4 / Chapter 1.4 --- Contribution --- p.5 / Chapter 1.5 --- Thesis Overview --- p.6 / Chapter CHAPTER 2. --- BACKGROUND TECHNOLOGIES --- p.7 / Chapter 2.1 --- Overview of XML --- p.7 / Chapter 2.1.1. --- XML Basic Syntax --- p.8 / Chapter 2.1.2. --- Namespaces in XML --- p.8 / Chapter 2.2 --- Overview of XML Schema --- p.9 / Chapter 2.2.1. --- W3C XML Schema --- p.10 / Chapter 2.2.2 --- ", Schema Alternatives" --- p.13 / Chapter 2.3 --- Overview of XPath --- p.13 / Chapter 2.4 --- Overview of DOM --- p.15 / Chapter CHAPTER 3. --- OVERVIEW OF STRUCTURED-ELEMENT OBJECT MODEL (SEOM) --- p.18 / Chapter 3.1 --- Introduction --- p.18 / Chapter 3.2 --- Objectives --- p.20 / Chapter 3.3 --- General Concepts in SEOM --- p.21 / Chapter 3.3.1. --- Data Representation --- p.21 / Chapter 3.3.2. --- Data Binding --- p.24 / Chapter 3.3.3. --- Data Access --- p.25 / Chapter CHAPTER 4. --- SEOM DOCUMENT MODELING --- p.27 / Chapter 4.1 --- Data Modeling --- p.27 / Chapter 4.1.1. --- Simple XML Data Model --- p.28 / Chapter 4.1.2. --- SEOM Data Model --- p.32 / Chapter 4.2 --- Schema Modeling --- p.41 / Chapter 4.2.1. --- SEOM Schema --- p.42 / Chapter 4.2.2. --- Creating a Schema --- p.46 / Chapter CHAPTER 5. --- SEOM DOCUMENT PROCESSING --- p.51 / Chapter 5.1 --- SEOM Document Processing --- p.51 / Chapter 5.2 --- The Classes --- p.51 / Chapter 5.2.1. --- SEOM Document Class --- p.52 / Chapter 5.2.2. --- A bstract SElement Class --- p.55 / Chapter 5.2.3. --- Generic SElement Class --- p.56 / Chapter 5.2.4. --- Implementation SElement Classes --- p.57 / Chapter 5.3 --- XML Parsing and Data Binding --- p.59 / Chapter 5.3.1. --- Parsing Process --- p.60 / Chapter 5.4 --- Querying --- p.62 / Chapter 5.4.1. --- Query Wrapper and Result Wrapper --- p.62 / Chapter 5.4.2. --- Embedding in XPath --- p.68 / Chapter CHAPTER 6. --- AN WEB-BASED SEOM DOCUMENT QUERY SYSTEM --- p.71 / Chapter 6.1 --- Web-based SEOM Document Query System --- p.71 / Chapter 6.2 --- Client-Server Architecture --- p.71 / Chapter 6.3 --- The Server --- p.74 / Chapter 6.3.1. --- Data Loading --- p.74 / Chapter 6.3.2. --- Implemented SElement - R-Tree --- p.74 / Chapter 6.3.3. --- Network Interface --- p.80 / Chapter 6.4 --- Client Side --- p.82 / Chapter 6.4.1. --- The Interface --- p.82 / Chapter 6.4.2. --- Programmatic Controls --- p.85 / Chapter CHAPTER 7. --- EVALUATION --- p.88 / Chapter 7.1 --- Experiment with Synthetic Data --- p.88 / Chapter 7.2 --- Qualitative Comparison --- p.90 / Chapter 7.3 --- Advantages --- p.91 / Chapter 7.4 --- Disadvantages --- p.92 / Chapter 7.5 --- Means of Enhancement --- p.93 / Chapter CHAPTER 8. --- CONCLUSION --- p.94 / BIBLIOGRAPHY --- p.97
76

Semantic query optimization for processing XML streams with minimized memory footprint

Li, Ming. January 2007 (has links)
Thesis (M.S.) -- Worcester Polytechnic Institute. / Keywords: optimization; XML; query evaluation; stream processing; database. Includes bibliographical references (p.66-67).
77

FoXQ : a visual query language for XML

Abraham, Robin 26 September 2003 (has links)
XML is a very versatile data format that has been used to represent many different kinds of data, including web pages, books, business and accounting data, programming interfaces, vector graphics, system logs, and games. In a short span of time, it has gained wide acceptance as the document and data standard on the web. As more and more XML data gets generated everyday, a lot of research focus has been on query languages for XML. The World-Wide Web Consortium (W3C) has chosen XQuery as the standard language for querying XML. From an end-user point of view, XQuery sacrifices usability for expressiveness. We introduce FoXQ, a visual language that enables end users to query XML. FoXQ brings a lot of the functionality of XQuery within the reach of the end users without getting them embroiled in the intricacies of XQuery syntax. The query interface is form-based and the query model is based on a document metaphor in which the users formulate queries by filling out forms. / Graduation date: 2004
78

Conflict detection and resolution during restructuring of XML data

Teterovskaya, Anna. January 2000 (has links) (PDF)
Thesis (M.S.)--University of Florida, 2000. / Title from first page of PDF file. Document formatted into pages; contains v, 111 p.; also contains graphics. Vita. Includes bibliographical references (p. 106-110).
79

Frames and Overflows in Rights Expression Languages

Gary J. Hausman 6 December 2006 (has links)
This paper analyzes the visions, schemas, and vocabularies of prominent rights expression languages, including Creative Commons, METS, ODRL, and MPEG-21. The paper extends Michel Callon’s sociological insight that all forms of human agency are multiple and diverse. Callon argues, in the context of economic sociology, that one must constantly decide between a strategy emphasizing “framing” as the norm with “overflows” treated as leaks, or conversely a strategy accepting “overflows” as the norm with “framing” as inherently imperfect. Callon’s categories are extended, through a modeling exercise, to the classification of current metadata schemes. The analysis suggests that metadata developers should explore what semantic choices and strictures are left out of metadata schemes, as well as those that are included. Such a thought exercise is especially useful in distinguishing areas suited for XML rights markup extensions.
80

Three XQuery optimization techniques implemented in IBM DB2 database system /

Xie, Guangjun. January 2007 (has links)
Thesis (M.Sc.)--York University, 2007. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 120-123). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR29315

Page generated in 0.0276 seconds