<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>data structures &#8211; Database Math </title>
	<atom:link href="https://databasemath.com/tag/data-structures/feed/" rel="self" type="application/rss+xml" />
	<link>https://databasemath.com</link>
	<description>Database mathematics and more pragmatic information.</description>
	<lastBuildDate>Tue, 31 Aug 2021 13:35:33 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.0.1</generator>
	<item>
		<title>Data Structures: Queue</title>
		<link>https://databasemath.com/2021/08/31/data-structures-queue/</link>
					<comments>https://databasemath.com/2021/08/31/data-structures-queue/#respond</comments>
		
		<dc:creator><![CDATA[Avery Lane]]></dc:creator>
		<pubDate>Tue, 31 Aug 2021 13:35:31 +0000</pubDate>
				<category><![CDATA[All Posts]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[dequeue]]></category>
		<category><![CDATA[enqueue]]></category>
		<category><![CDATA[queue]]></category>
		<category><![CDATA[queuing system]]></category>
		<guid isPermaLink="false">https://databasemath.com/?p=386</guid>

					<description><![CDATA[A Queue is a FIFO (First In First Out — the element placed at first can be accessed at first) structure which can be commonly found in many programming languages. This structure is named as &#8220;queue&#8221; because it resembles a real-world queue — people waiting in a queue (line). Just like in like real life, &#8230; <a href="https://databasemath.com/2021/08/31/data-structures-queue/" class="more-link">Continue reading<span class="screen-reader-text"> "Data Structures: Queue"</span></a>]]></description>
		
					<wfw:commentRss>https://databasemath.com/2021/08/31/data-structures-queue/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Data Structures: Stack</title>
		<link>https://databasemath.com/2021/08/31/data-structures-stack/</link>
					<comments>https://databasemath.com/2021/08/31/data-structures-stack/#respond</comments>
		
		<dc:creator><![CDATA[Avery Lane]]></dc:creator>
		<pubDate>Tue, 31 Aug 2021 13:22:48 +0000</pubDate>
				<category><![CDATA[All Posts]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[expression evaluation]]></category>
		<category><![CDATA[isEmpty]]></category>
		<category><![CDATA[isFull]]></category>
		<category><![CDATA[linear data structure]]></category>
		<category><![CDATA[Peek]]></category>
		<category><![CDATA[Pop]]></category>
		<category><![CDATA[Push]]></category>
		<category><![CDATA[recursion programming]]></category>
		<category><![CDATA[stack]]></category>
		<guid isPermaLink="false">https://databasemath.com/?p=380</guid>

					<description><![CDATA[A Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO (Last In First Out) or FILO (First In Last Out). Push: Insert an element on to the top of the stack. Pop: Delete the topmost element and return it. Furthermore, the following &#8230; <a href="https://databasemath.com/2021/08/31/data-structures-stack/" class="more-link">Continue reading<span class="screen-reader-text"> "Data Structures: Stack"</span></a>]]></description>
		
					<wfw:commentRss>https://databasemath.com/2021/08/31/data-structures-stack/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Structured, Unstructured and Semi-Structured Data</title>
		<link>https://databasemath.com/2021/07/26/structured-unstructured-and-semi-structured-data/</link>
					<comments>https://databasemath.com/2021/07/26/structured-unstructured-and-semi-structured-data/#respond</comments>
		
		<dc:creator><![CDATA[Avery Lane]]></dc:creator>
		<pubDate>Mon, 26 Jul 2021 19:14:20 +0000</pubDate>
				<category><![CDATA[All Posts]]></category>
		<category><![CDATA[NoSQL]]></category>
		<category><![CDATA[big data]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[semi structured data]]></category>
		<category><![CDATA[structured data]]></category>
		<category><![CDATA[three v&#039;s]]></category>
		<category><![CDATA[unstructured data]]></category>
		<category><![CDATA[variety]]></category>
		<category><![CDATA[velocity]]></category>
		<category><![CDATA[volume]]></category>
		<guid isPermaLink="false">https://databasemath.com/?p=327</guid>

					<description><![CDATA[Big Data vs. Relational Data The advent of &#8220;Big Data&#8221; is relatively new and is loosely defined as data that contains greater variety, arriving in increasing volumes and with more velocity. This is also known as the Three Vs. Greater than what? Well, greater than the data that would traditional be handled by a traditional &#8230; <a href="https://databasemath.com/2021/07/26/structured-unstructured-and-semi-structured-data/" class="more-link">Continue reading<span class="screen-reader-text"> "Structured, Unstructured and Semi-Structured Data"</span></a>]]></description>
		
					<wfw:commentRss>https://databasemath.com/2021/07/26/structured-unstructured-and-semi-structured-data/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
