Data Portal @ linkeddatafragments.org

Matches in ScholarlyData for { ?s ?p ?o. }

• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent eric-brewer.
• item-2 previous item-1.
• 910 creator dimitri-theodoratos.
• 910 creator stefanos-souldatos.
• 910 creator theodore-dalamagas.
• 910 creator timos-sellis.
• 910 creator xiaoying-wu.
• 910 type InProceedings.
• 910 label "Efficient Evaluation of Generalized Path Pattern Queries on XML Data".
• 910 sameAs 910.
• 910 abstract "Finding the occurrences of structural patterns in XML data is a key operation in XML query processing. Existing algorithms for this operation focus almost exclusively on path-patterns or tree-patterns. Requirements in flexible querying of XML data have motivated recently the introduction of query languages that allow a partial specification of path-patterns in a query. In this paper, we focus on the efficient evaluation of partial path queries with repeated labels (that is, multiple occurrences of the same label). We show that partial path queries can be represented as rooted dags for which a topological ordering of the nodes exists. We present three algorithms for the efficient evaluation of these queries under the index streaming evaluation model. The first one exploits a structural summary of data to generate a set of path-patterns that together are equivalent to a partial path query. To evaluate these path-patterns, we extend PathStack so that it can work on path-patterns with repeated labels. The second one extracts a spanning tree from the query dag, uses a stack-based algorithm to find the matches of the root-to-leaf paths in the tree, and merge-join the matches to compute the answer. Finally, the third one exploits multiple pointers of stack entries and a topological ordering of the query dag to apply a stack-based holistic technique. An analysis of the algorithms and extensive experimental evaluation shows that the holistic algorithm outperforms the other ones.".
• 910 hasAuthorList authorList.
• 910 hasTopic World_Wide_Web.
• 910 isPartOf proceedings.
• 910 keyword "XML".
• 910 keyword "query evaluation".
• 910 keyword "query language".
• 910 title "Efficient Evaluation of Generalized Path Pattern Queries on XML Data".
• authorList type List.
• authorList hasFirstItem item-1.
• authorList hasItem item-1.
• authorList hasItem item-2.
• authorList hasItem item-3.
• authorList hasItem item-4.
• authorList hasItem item-5.
• authorList hasLastItem item-5.
• item-1 type ListItem.
• item-1 hasContent xiaoying-wu.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent stefanos-souldatos.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent dimitri-theodoratos.
• item-3 next item-4.
• item-3 previous item-2.
• item-4 type ListItem.
• item-4 hasContent theodore-dalamagas.
• item-4 next item-5.
• item-4 previous item-3.
• item-5 type ListItem.
• item-5 hasContent timos-sellis.
• item-5 previous item-4.
• 916 creator aimin-pan.
• 916 creator bin-zhu.
• 916 creator bosheng-zhou.
• 916 creator min-feng.
• 916 creator rui-guo.
• 916 type InProceedings.
• 916 label "CompoWeb: A Component-Oriented Web Architecture".
• 916 sameAs 916.
• 916 abstract "In this paper, client-site Web mashups are studied from component-oriented perspective, and CompoWeb, a component-oriented Web architecture, is proposed. In CompoWeb, a Web application is decomposed into Web components called gadgets. A gadget is an abstraction of functional or logical Web component. It is isolated from other gadgets for security and reliability. Contract-based channels are the only way to interact with each other. An abstraction of contract-based channels supported or required by a gadget is also presented. It enables binding of gadgets at deployment, and promotes interchangeable gadgets. Unlike the model of a normal function call where the function logic is executed in caller’s context, CompoWeb ensures that the function logic is executed in callee’s context so that both the caller and callee are protected. Implementation of a prototype CompoWeb system and its performance are also presented. In many ways, CompoWeb resembles the research operating system Singularity.".
• 916 hasAuthorList authorList.
• 916 hasTopic World_Wide_Web.
• 916 isPartOf proceedings.
• 916 keyword "component oriented paradigm".
• 916 keyword "same-origin policy".
• 916 keyword "secure mashup".
• 916 keyword "web gadget".
• 916 title "CompoWeb: A Component-Oriented Web Architecture".
• authorList type List.
• authorList hasFirstItem item-1.
• authorList hasItem item-1.
• authorList hasItem item-2.
• authorList hasItem item-3.
• authorList hasItem item-4.
• authorList hasItem item-5.
• authorList hasLastItem item-5.
• item-1 type ListItem.
• item-1 hasContent rui-guo.
• item-1 next item-2.
• item-2 type ListItem.
• item-2 hasContent bin-zhu.
• item-2 next item-3.
• item-2 previous item-1.
• item-3 type ListItem.
• item-3 hasContent min-feng.
• item-3 next item-4.
• item-3 previous item-2.
• item-4 type ListItem.
• item-4 hasContent aimin-pan.
• item-4 next item-5.
• item-4 previous item-3.
• item-5 type ListItem.
• item-5 hasContent bosheng-zhou.
• item-5 previous item-4.
• 92 creator manjeet-rege.
• 92 creator ming-dong.
• 92 type InProceedings.
• 92 label "Graph Theoretical Framework for Simultaneously Integrating Visual and Textual Features for Efficient Web Image Clustering".
• 92 sameAs 92.
• 92 abstract "With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering has emerged as an important application. Some of the initial efforts along this direction revolved around clustering Web images based on the visual features of images or textual features by making use of the text surrounding the images. However, not much work has been done in using multimodal information for clustering Web images. In this paper, we propose a graph theoretical framework for simultaneously integrating visual and textual features for efficient Web image clustering. Specifically, we model visual features, images and words from surrounding text using a tripartite graph. Partitioning this graph leads to clustering of the Web images. Although, graph partitioning approach has been adopted before, the main contribution of this work lies in a new algorithm that we propose - Consistent Isoperimetric High-order Co-clustering (CIHC), for partitioning the tripartite graph. Computationally, CIHC is very quick as it requires a simple solution to a sparse system of linear equations. Our theoretical analysis and extensive experiments performed on real Web images demonstrate the performance of CIHC in terms of the quality, efficiency and scalability in partitioning the visual feature-image-word tripartite graph.".
• 92 hasAuthorList authorList.
• 92 hasTopic World_Wide_Web.
• 92 isPartOf proceedings.
• 92 keyword "Co-clustering".
• 92 keyword "Web images".

• first
• previous
• next