<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Excel Goodies</title>
    <description>The latest articles on DEV Community by Excel Goodies (@excel_goodies_849c05987fe).</description>
    <link>https://dev.to/excel_goodies_849c05987fe</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F4198986%2F25a627c2-eab0-4cd5-bb17-6425b1660c16.png</url>
      <title>DEV Community: Excel Goodies</title>
      <link>https://dev.to/excel_goodies_849c05987fe</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/excel_goodies_849c05987fe"/>
    <language>en</language>
    <item>
      <title>Fix hot-shuffle anti-patterns to cut Databricks waste</title>
      <dc:creator>Excel Goodies</dc:creator>
      <pubDate>Wed, 21 Oct 2026 20:00:03 +0000</pubDate>
      <link>https://dev.to/excel_goodies_849c05987fe/fix-hot-shuffle-anti-patterns-to-cut-databricks-waste-4bca</link>
      <guid>https://dev.to/excel_goodies_849c05987fe/fix-hot-shuffle-anti-patterns-to-cut-databricks-waste-4bca</guid>
      <description>&lt;p&gt;Start with the anti-pattern: repeated wide shuffles caused by repartitioning or doing joins followed immediately by groupBy on different keys. That’s the cheap, invisible way a cluster will chew CPU, network and spill to disk for minutes at a time.&lt;/p&gt;

&lt;p&gt;A few concrete things that stop the bleeding fast: prefer a broadcast join when one side is small, pre-partition data on the join/group key so work stays local, and avoid unnecessary repartition()/coalesce() calls that reshuffle everything without reason. Also check spark.sql.shuffle.partitions — the default is often far higher than your actual parallelism needs.&lt;/p&gt;

&lt;p&gt;How I debug this in practice: open the Spark UI, look at the stages with the biggest Shuffle Read/Write and the highest task spill. If a small number of partitions handle most bytes, you’ve got skew or a hot-shuffle hotspot. If many tasks are short but network reads are huge, it’s a repartitioning problem.&lt;/p&gt;

&lt;p&gt;Quick checklist you can run through:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;try a broadcast join or lower spark.sql.autoBroadcastJoinThreshold for small tables&lt;/li&gt;
&lt;li&gt;set spark.sql.shuffle.partitions to match actual parallelism and enable adaptive execution (spark.sql.adaptive.enabled)&lt;/li&gt;
&lt;li&gt;pre-partition on stable keys and avoid redundant repartition()/repartitionByRange()&lt;/li&gt;
&lt;li&gt;cache only when it prevents repeated expensive shuffles, and unpersist promptly&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;If you want hands-on exercises and walkthroughs for cluster sizing, Spark configs and shuffle debugging, the &lt;a href="https://www.excelgoodies.com" rel="noopener noreferrer"&gt;Databricks training&lt;/a&gt; covers these topics with real notebooks and examples.&lt;/p&gt;

</description>
      <category>data</category>
      <category>debugging</category>
      <category>performance</category>
    </item>
    <item>
      <title>Hybrid storage modes silently slowing dashboards</title>
      <dc:creator>Excel Goodies</dc:creator>
      <pubDate>Wed, 21 Oct 2026 18:56:24 +0000</pubDate>
      <link>https://dev.to/excel_goodies_849c05987fe/hybrid-storage-modes-silently-slowing-dashboards-25o3</link>
      <guid>https://dev.to/excel_goodies_849c05987fe/hybrid-storage-modes-silently-slowing-dashboards-25o3</guid>
      <description>&lt;p&gt;If you mix DirectQuery and Import tables on the same visual, Power BI can end up firing repeated queries to the remote source to resolve filters and relationships — and that’s usually the real cause of a sluggish dashboard. Practical fixes that helped me on a Chennai retail project:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Keep DirectQuery tables out of visuals that combine Import facts; use Dual on small lookup dimensions so filters flow without forcing the fact table remote.&lt;/li&gt;
&lt;li&gt;Build a small Import aggregate table for summary visuals (weekly/monthly) and point slicers to Import lookups.&lt;/li&gt;
&lt;li&gt;Audit relationships: a chain that crosses storage modes often changes where joins/filters are executed.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;These simple patterns make visuals predictable and avoid surprise round-trips. If you want to go deeper on storage modes and query plans, consider the Power BI batch in Chennai (&lt;a href="https://www.excelgoodies.in/powerbi-training" rel="noopener noreferrer"&gt;the Power BI batch in Chennai&lt;/a&gt;).&lt;/p&gt;

</description>
    </item>
    <item>
      <title>CDC into Fabric: preserve order and avoid duplicates</title>
      <dc:creator>Excel Goodies</dc:creator>
      <pubDate>Wed, 21 Oct 2026 18:45:53 +0000</pubDate>
      <link>https://dev.to/excel_goodies_849c05987fe/cdc-into-fabric-preserve-order-and-avoid-duplicates-10od</link>
      <guid>https://dev.to/excel_goodies_849c05987fe/cdc-into-fabric-preserve-order-and-avoid-duplicates-10od</guid>
      <description>&lt;p&gt;Concrete technique: treat CDC as an ordered append-only stream and carry the source transaction identity (LSN/tx_id) plus a per-transaction operation sequence (op_seq) for every row. Make your staging + merge logic explicitly sequence-aware so you only apply a row if its (tx_id, op_seq) is newer than what’s already in the target.&lt;/p&gt;

&lt;p&gt;What I do in practice — simple, reliable, and survives retries:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Capture: store every change as an append-only row with pk, tx_id (LSN), op_seq, is_delete, and raw payload. Include a source timestamp but don’t rely on it for ordering.&lt;/li&gt;
&lt;li&gt;Stage: ingest into a small staging table and collapse duplicates within the same tx by keeping the max(op_seq) per (pk, tx_id). This removes noise from ingestion retries.&lt;/li&gt;
&lt;li&gt;Apply (idempotent MERGE): MERGE into the target using pk; in the WHEN MATCHED branch only update/delete when incoming.tx_id &amp;gt; target.tx_id OR (incoming.tx_id = target.tx_id AND incoming.op_seq &amp;gt; target.op_seq). Insert when no match. Treat deletes as a distinct op applied the same way.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Two practical extras that saved me from painful outages:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Maintain a per-partition processed watermark (highest tx_id applied). It lets you ignore older batches deterministically and speeds incremental runs.&lt;/li&gt;
&lt;li&gt;Persist the applied (tx_id, op_seq) on the target row so subsequent merges are cheap comparisons, not full payload diffs.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;The mistake I see most often: relying on last_updated timestamps or naïve upserts that don’t check sequence. That works until a retry or out-of-order delivery creates duplicates, resurrected rows, or lost deletes.&lt;/p&gt;

&lt;p&gt;If you want to go deeper on sequencing patterns and example MERGE snippets for Fabric, the Fabric Data Engineering training (&lt;a href="https://www.excelgoodies.com/microsoft-fabric-power-bi-course-usa" rel="noopener noreferrer"&gt;the Fabric Data Engineering training&lt;/a&gt;) covers these workflows.&lt;/p&gt;

</description>
    </item>
  </channel>
</rss>
