http://floatingsun.net/2009/03/17/diving-into-npath/?utm_source=rss&utm_medium=rss&utm_campaign=diving-into-npath Mon, 06 Feb 2012 12:32:40 +0000 hourly 1 http://wordpress.org/?v=3.3.1 http://floatingsun.net/2009/03/17/diving-into-npath/#comment-180813 dave Thu, 25 Jun 2009 03:38:38 +0000 http://floatingsun.net/?p=1012#comment-180813 Not a very deep analysis. How many rows can be returned per partition? One per matching sequence, or is there one row per matching sequence? If the latter, why is "first" needed? What does it do? How is the degree of parallelism of the function decided? I.e. on how are the nodes over which the input table is partition decided? Is this an optimizer decision or something that can be hinted at? What does the "mode" argument do? What oth Not a very deep analysis. How many rows can be returned per partition? One per matching sequence, or is there one row per matching sequence? If the latter, why is “first” needed? What does it do? How is the degree of parallelism of the function decided? I.e. on how are the nodes over which the input table is partition decided? Is this an optimizer decision or something that can be hinted at? What does the “mode” argument do? What oth

]]>