Guido Moerkotte  Home/Search
Context Related
| pi3.informatik.unimannh...MA0312.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: pi3.informatik....Details.html.en (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: One of the main features of XQuery compared to traditional query languages like SQL, is that it preserves the input order---unless specified otherwise. As a consequence, order-preserving algebraic operators are needed to capture the semantics of XQuery correctly. One important algebraic operator is the orderpreserving join. (Update)
Cited by: More
Index Structures and Algorithms for Querying - Distributed Rdf Repositories (2004) (Correct)
Index Structures and Algorithms for Querying.. - Stuckenschmidt.. (2004) (Correct)
XQuery Processing in Natix with an Emphasis on Join - May (2004) (Correct)
Active bibliography (related documents): More All
0.2: Nested Queries and Quantifiers in an Ordered Context - May, Helmer, Moerkotte (2003) (Correct)
0.2: A model for imperfect XML data based on Dempster-Shafer's.. - Magnani, Montesi (2005) (Correct)
0.1: Optimal Ordering of Selections and Joins in Acyclic.. - Scheufele, Moerkotte (Correct)
Similar documents based on text:
3.0: Unknown - (Correct)
Related documents from co-citation: More All
4: Measuring the complexity of join enumeration in query optimization (context) - Ono, Lohman - 1990
3: Principles of Database Query Processing for Advanced Applications (context) - Yu, Meng - 1998
3: Sesame: A generic architecture for storing and querying rdf and rdf schema - Broekstra, Kampman et al. - 2002
BibTeX entry: (Update)
G. Moerkotte. Constructing Optimal Bushy Trees Possibly Containing Cross Products for Order Preserving Joins is in P. Technical Report 12, University of Mannheim, 2003. http://citeseer.ist.psu.edu/moerkotte03constructing.html More
@misc{ moerkotte03constructing,
author = "G. Moerkotte",
title = "Constructing Optimal Bushy Trees Possibly Containing Cross Products for
Order Preserving Joins is in P",
text = "G. Moerkotte. Constructing Optimal Bushy Trees Possibly Containing Cross
Products for Order Preserving Joins is in P. Technical Report 12, University
of Mannheim, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/moerkotte03constructing.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990 ACM
88 Predicate migration: Optimizing queries with expensive predi.. - Hellerstein, Stonebraker - 1993 DBLP
78 Optimization of nonrecursive queries (context) - Krishnamurthy, Boral et al. - 1986 ACM DBLP
32 Practical predicate placement - Hellerstein - 1994 ACM DBLP
32 Optimization of queries with user-defined predicates - Chaudhuri, Shim - 1999 ACM DBLP
29 Optimal nesting for computing n-relational joins (context) - Ibaraki, Kameda - 1984
28 SAL: An algebra for semistructured data and XML - Beeri, Tzaban - 1999 DBLP
13 AQuery: query language for ordered data (context) - Lerner, Shasha - 2003
12 the complexity of generating optimal leftdeep processing tre.. - Cluet, Moerkotte - 1996
7 Order-preserving hash joins: Sorting (context) - Claussen, Kemper et al. - 1998
6 XAL: An algebra for XML query optimization - Frasincar, Houben et al. - 2002 DBLP
Documents on the same site (http://pi3.informatik.uni-mannheim.de/publikationenDetails.html.en): More
Partition-Based Clustering in Object Bases: From.. - Gerlhof, Kemper.. (1993) (Correct)
Main Memory Implementations for Binary Grouping - May, Moerkotte (2005) (Correct)
Optimizing Queries with Universal Quantification.. - Claussen, Kemper, .. (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC