Filters








511 Hits in 4.1 sec

Page 53 of Mathematical Reviews Vol. , Issue 99a [page]

<span title="">1991</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Graphs omitting a bushy tree. (English summary) J. Graph Theory 26 (1997), no. 4, 203-210. Summary: “A tree is called bushy if it has no vertex of degree 2.  ...  Theorem: The class of countable graphs omitting a fixed finite bushy tree with at least 5 vertices has no universal element.” 99a:05123 05C75 Dahlhaus, Elias (D-BONN-C5; Bonn); Manuel, Paul D. (5-NEWC-C  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1991-01_99a/page/53" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1991-01_99a/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Warp-Edge Optimization in XPath [chapter]

Haiyun He, Curtis Dyreson
<span title="">2002</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
The XPath data model is a tree-like data model that has an edge from an element to each component in the content of that element. The edges are traversed in the evaluation of an XPath expression.  ...  A warp edge is an edge that is something other than a parent to child edge, i.e., an edge from an element to a sibling or to a grandchild.  ...  The bushiness can be fixed or chosen randomly from a range. The tree is made random in two ways.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-46105-1_22">doi:10.1007/3-540-46105-1_22</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jt3lef3zwbethoxvaleg6icgja">fatcat:jt3lef3zwbethoxvaleg6icgja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808130701/http://digital.cs.usu.edu/~cdyreson/pub/papers/ewis.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/07/d6/07d6546d7863d4bd0c5154baf4f66dc025deb808.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-46105-1_22"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Polynomial heuristics for query optimization

Nicolas Bruno, Cesar Galindo-Legaria, Milind Joshi
<span title="">2010</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vuw5ktdyknehrehttg5qm4rfqm" style="color: black;">2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)</a> </i> &nbsp;
We also introduce a realistic workload generator and validate our approach using both synthetic and real data. H J H J H J H J I J  ...  In this paper we propose a heuristic approach to very efficiently obtain execution plans for complex queries, which takes into account the presence of indexes and goes beyond simple join reordering.  ...  Bushy Trees Since bushy trees include linear trees, the optimal bushy tree is never worse than the optimal linear tree.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icde.2010.5447916">doi:10.1109/icde.2010.5447916</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icde/BrunoGJ10.html">dblp:conf/icde/BrunoGJ10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zexsoi7gifas7h6y2kjksiemby">fatcat:zexsoi7gifas7h6y2kjksiemby</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110401062755/http://research.microsoft.com/pubs/132009/ICDE10_conf_full_106.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e8/9f/e89fb3dd3412fc45506bfd06ea338d31093215ab.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icde.2010.5447916"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs [chapter]

Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco
<span title="">2005</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We also give a 7/2approximation algorithm, thus improving on the 4-approximation scheme observed in [2] . Our approach is to explore the given input graph via some spanning tree.  ...  For a given graph and a given starting node we are interested in finding the fastest possible Black Hole Search by two agents (the minimum number of agents capable to identify a black hole).  ...  Algorithm Generate-Tree uses procedure Bushy-Tree(G ′ , v) which for a given graph G ′ = (V ′ , E ′ ) and a node v ∈ V ′ computes a maximal bushy tree T in G ′ rooted at v (that is, there is no bushy tree  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11429647_17">doi:10.1007/11429647_17</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lc3htz6k5jckfbxzjtv2cjzmsq">fatcat:lc3htz6k5jckfbxzjtv2cjzmsq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808174737/http://optlab.mcmaster.ca/~emarkou/_Media/bhs-sirocco.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8a/9b/8a9b66eb76e99104cbb3285433efa8199070d88b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11429647_17"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

The MemSQL query optimizer

Jack Chen, Samir Jindel, Robert Walzer, Rajkumar Sen, Nika Jimsheleishvilli, Michael Andrews
<span title="2016-09-01">2016</span> <i title="VLDB Endowment"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6rqwwpkkjbcldejepcehaalby" style="color: black;">Proceedings of the VLDB Endowment</a> </i> &nbsp;
We discuss methods to make join enumeration faster and more effective, such as a rewrite-based approach to exploit bushy joins in queries involving multiple star schemas without sacrificing optimization  ...  time does not become a bottleneck.  ...  The Enumerator chooses the best left-deep join tree within each select block. By placing a derived table on the right side of a join, we form a bushy join tree.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14778/3007263.3007277">doi:10.14778/3007263.3007277</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gbbm7sr6e5gnfiq2q4jrhimqs4">fatcat:gbbm7sr6e5gnfiq2q4jrhimqs4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180219044612/http://15721.courses.cs.cmu.edu:80/spring2018/papers/16-optimizer2/chen-vldb2016.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/62/86/6286040d8f9f3f930ab96b2c301755d72561217f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14778/3007263.3007277"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Bushy pseudocharacters and group actions on quasitrees

Álvaro Martínez-Pérez
<span title="2012-08-04">2012</span> <i title="Mathematical Sciences Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zcokwzr5jnc2lol6jqxbob7l4e" style="color: black;">Algebraic and Geometric Topology</a> </i> &nbsp;
Given a group acting on a graph quasi-isometric to a tree, we give sufficent conditions for a pseudocharacter to be bushy. We relate this with the conditions studied by M. Bestvina and K.  ...  In [15] , Mosher, Sageev, and Whyte prove that every cobounded quasiaction on a bounded valence bushy tree is quasiconjugate to an action on a tree.  ...  See [12] for the examples and [13] for further results on quasiactions on trees. Given a nonuniform pseudocharacter h, Manning builds in [12] a cobounded quasiaction on a bushy tree T .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2140/agt.2012.12.1721">doi:10.2140/agt.2012.12.1721</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oojfjgr5dbglnfoo4ibtxarupm">fatcat:oojfjgr5dbglnfoo4ibtxarupm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723051706/https://msp.org/agt/2012/12-3/agt-v12-n3-p17-s.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a0/84/a084a7ac133ba1273d9e8c47851106e6e1298386.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2140/agt.2012.12.1721"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Managing the operator ordering problem in parallel databases

Harald Kosch
<span title="">2000</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/idqeix2ukbd5fbgjjdkjmaj3ka" style="color: black;">Future generations computer systems</a> </i> &nbsp;
We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs).  ...  Compared to the related approach of Bushy Trees (BTs) a significant complexity reduction of the operator ordering problem, while not loosing quality, can be derived theoretically and demonstrated later  ...  Fig. 1 shows on the left hand a left-deep tree, in the middle a bushy tree and on the right hand a right-deep tree.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0167-739x(99)00080-1">doi:10.1016/s0167-739x(99)00080-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3xjlzfrrirb27jakg2oa756wcm">fatcat:3xjlzfrrirb27jakg2oa756wcm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808143350/http://www.isys.uni-klu.ac.at/PDF/1998-0039-Kosc.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a6/ef/a6efc635441b18152a75166517e4c52cb33cdacc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0167-739x(99)00080-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Bushy pseudocharacters and group actions on quasitrees

Álvaro Martínez-Pérez
<span title="2012-08-04">2012</span> <i title="Mathematical Sciences Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zcokwzr5jnc2lol6jqxbob7l4e" style="color: black;">Algebraic and Geometric Topology</a> </i> &nbsp;
Given a group acting on a graph quasi-isometric to a tree, we give sufficient conditions for a pseudocharacter to be bushy.  ...  In [15] , Mosher, Sageev, and Whyte prove that every cobounded quasiaction on a bounded valence bushy tree is quasiconjugate to an action on a tree.  ...  See [12] for the examples and [13] for further results on quasiactions on trees. Given a nonuniform pseudocharacter h, Manning builds in [12] a cobounded quasiaction on a bushy tree T .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2140/agt.2012.12.1725">doi:10.2140/agt.2012.12.1725</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nu44hrtvnze4ncxd3xpqjgfvu4">fatcat:nu44hrtvnze4ncxd3xpqjgfvu4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180723051706/https://msp.org/agt/2012/12-3/agt-v12-n3-p17-s.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a0/84/a084a7ac133ba1273d9e8c47851106e6e1298386.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2140/agt.2012.12.1725"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Query optimization of distributed pattern matching

Jiewen Huang, Kartik Venkatraman, Daniel J. Abadi
<span title="">2014</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/vuw5ktdyknehrehttg5qm4rfqm" style="color: black;">2014 IEEE 30th International Conference on Data Engineering</a> </i> &nbsp;
These techniques include (1) a System-R style dynamic programming-based optimization algorithm that considers both linear and bushy plans, (2) a cycle detection-based algorithm that leverages cycles to  ...  Greedy algorithms for subgraph pattern matching operations are often sufficient when the graph data set can be held in memory on a single machine.  ...  Acknowledgments This work was sponsored by the NSF under grant IIS-0845643 and by a Sloan Research Fellowship.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icde.2014.6816640">doi:10.1109/icde.2014.6816640</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icde/HuangVA14.html">dblp:conf/icde/HuangVA14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oy6twopc5jhhdhrnkizrtkntbu">fatcat:oy6twopc5jhhdhrnkizrtkntbu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150529012850/http://cs-www.cs.yale.edu:80/homes/dna/papers/subgraph-opt.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/17/c0/17c0c98ce76c5e7735c490de37a33963683cc66c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icde.2014.6816640"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Scalable distributed subgraph enumeration

Longbin Lai, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang, Shiyu Yang
<span title="2016-11-01">2016</span> <i title="VLDB Endowment"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6rqwwpkkjbcldejepcehaalby" style="color: black;">Proceedings of the VLDB Endowment</a> </i> &nbsp;
Subgraph enumeration aims to find all the subgraphs of a large data graph that are isomorphic to a given pattern graph.  ...  We then generalize the left-deep join framework and develop a dynamic-programming algorithm to compute an optimal bushy join plan. We also consider overlaps among the join units.  ...  Note that a left-deep tree is also a bushy tree. Example 2. Consider the pattern graph P and the decomposition D(P ) = {q0, q1, q2, q3} in the left part of Figure 2 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14778/3021924.3021937">doi:10.14778/3021924.3021937</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dv7eh22qtjap7li3xj3paalpxy">fatcat:dv7eh22qtjap7li3xj3paalpxy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190228061213/http://pdfs.semanticscholar.org/8d7e/87e4d027aaf794835a8137364f56bd378a59.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/8d/7e/8d7e87e4d027aaf794835a8137364f56bd378a59.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14778/3021924.3021937"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Hierarchy for imbedding-distribution invariants of a graph

Jonathan L. Gross, Merrick L. Furst
<span title="">1987</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ukzsjb6a6zhyxnjl6nb2mmjc6m" style="color: black;">Journal of Graph Theory</a> </i> &nbsp;
Further up in the hierarchy is the multiset of duals of a graph. At an intermediate level are the ·imbedding polynomials·.  ...  An entirely dirrerent viewpoint is now presented, in which one seeks distributional information about the huge family of all cellular imbeddings of a graph into all closed surfaces, instea~ of focusing  ...  19721) Let G be a graph that is neither a tree nor a tree or bushy cycles. Then the genus range or G contains more than one integer.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/jgt.3190110211">doi:10.1002/jgt.3190110211</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zop4t24jqjbpdjrzgnvlddra2q">fatcat:zop4t24jqjbpdjrzgnvlddra2q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706093346/https://academiccommons.columbia.edu/download/fedora_content/download/ac%3A141150/CONTENT/cucs-194-85.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/47/8c/478c4715eddc00f58ee579fef9b94a0a3245357e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/jgt.3190110211"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

Optimizing join enumeration in transformation-based query optimizers

Anil Shanbhag, S. Sudarshan
<span title="2014-08-01">2014</span> <i title="VLDB Endowment"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6rqwwpkkjbcldejepcehaalby" style="color: black;">Proceedings of the VLDB Endowment</a> </i> &nbsp;
In this paper we propose two new rulesets for generating cross-product free trees.  ...  One of the rulesets is a minor extension of a simple but inefficient ruleset, which we prove is complete (we also show that a naive extension of an efficient ruleset leads to incompleteness).  ...  A well-accepted heuristic used in optimizers is to consider all bushy join trees, but exclude cross products from the search, presuming that all considered queries span a connected query graph [14] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14778/2732977.2732997">doi:10.14778/2732977.2732997</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dvkq226gwjgtzlkh5hbtbgtcqy">fatcat:dvkq226gwjgtzlkh5hbtbgtcqy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20150318145346/http://www.vldb.org/pvldb/vol7/p1243-shanbhag.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/91/97/91975d7e1ba905bedc3f42e834f0207a2290559e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14778/2732977.2732997"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Searching for a Black Hole in Tree Networks [chapter]

Jurek Czyzowicz, Dariusz Kowalski, Euripides Markou, Andrzej Pelc
<span title="">2005</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
For arbitrary trees we give a 5/3-approximation algorithm for this problem.  ...  We consider the task of locating a black hole in a (partially) synchronous tree network, assuming an upper bound on the time of any edge traversal by an agent.  ...  Trees in T will be called bushy trees. Let T be a bushy tree with root s and let u be an internal node of T .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11516798_5">doi:10.1007/11516798_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rlwyp7pm4be45csjfdqhavjca4">fatcat:rlwyp7pm4be45csjfdqhavjca4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808174742/http://optlab.mcmaster.ca/~emarkou/_Media/opodis.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/19/61/196131ee80bc1da1b0936554b94fd3f9f450ca61.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11516798_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Improved Algorithms for 3-Coloring, 3-Edge-Coloring, and Constraint Satisfaction [article]

David Eppstein
<span title="2000-09-13">2000</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We give a fast algorithm for (3,2)-CSP and use it to improve the time bounds for solving the other problems listed above.  ...  Our techniques involve a mixture of Davis-Putnam-style backtracking with more sophisticated matching and network flow based ideas.  ...  Proof: As described, we find a maximal bushy forest F, then cover the remaining vertices by height-two trees.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0009006v1">arXiv:cs/0009006v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3cuaqekg4rd5xm2uxffvygtgcu">fatcat:3cuaqekg4rd5xm2uxffvygtgcu</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0009006/cs0009006.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/06/c8/06c84cbbd9a8e12aa3b20c353b69f2ca30151252.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0009006v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Considering data skew factor in multi-way join query optimization for parallel execution

Kien A. Hua, Yo-Lung Lo, Honesty C. Young
<span title="">1993</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bj2uhzcrunglzmjsyjjm3qh4hm" style="color: black;">The VLDB journal</a> </i> &nbsp;
A consensus on parallel architecture for very large database management has emerged. This architecture is based on a shared-nothing hardware organization.  ...  In particular, we present a join-ordering strategy that takes load-balancing issues into consideration.  ...  Chen et al. (1992) proposed a technique that uses a segmented right-deep tree (a bushy tree of right-deep subtrees) for query execution tree selection.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf01228673">doi:10.1007/bf01228673</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wuo6quy7qnda7ljl2exovdr3sa">fatcat:wuo6quy7qnda7ljl2exovdr3sa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706105016/http://www.vldb.org/journal/VLDBJ2/P303.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/86/a4/86a48a1b4f51c378a0928f61f5f9613696442650.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf01228673"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 511 results