I have a development db that's running on sql 2014 in 2012 compatibility that I'm having an issue with trying to shrink the log file.    The mdf is 60+gb and the log is 80+gb but since it's dev like to shrink this down.    I've tried shrinking the log after backing up the db from both the gui and command line but doesn't work.  I switched the db to simple recovery model, backing up and trying to shrink multiple times but still nothing. I've also tried dbcc shrinkfile to either truncate the file or set it to a specific size but nothing..  when I run dbcc loginfo I do see entries with the status '2' but backing up the db/log in various attempts doesn't seem clear this out like normal.    Since its dev I even tried deattaching and reattaching without the log and it throws an error, if I try to create the db (that's still unattached) using 'for attach' or 'for attach_rebuild_log' it will either fail or create the log file with the same size and issues as before.   I checked the log_reuse_wiat_desc and it shows 'XTP_CHECKPOINT' which I believe is an in memory setting so wondering if the developer was testing any in memory objects if it could have caused this issue?  Sure appreciate any thoughts on this!  again since it's a dev db, that's backed up, its not a show stopping issue but like to figure this out in case it happens in prod.  Thanks, Jeff
I have a question about XTP_CHECKPOINT.  I'm using SQL Server 2014. I have a database that is in SIMPLE recovery model mode. It is also being replicated.  There are no open transactions. I've run DBCC OPENTRAN and it returns:     "No active open transactions."   But I keep getting this message whenever I try to create or drop a table or delete data: (I've replaced my actual database name with the word database_name)     "The transaction log for database 'database_name' is full due to 'XTP_CHECKPOINT'"     Does anyone know why this might be happening, and, more importantly, how can I make it stop?  And yes, the database really is in SIMPLE recovery model mode. i.e. The transaction log should truncate automatically.  Incidentally, another database that I have in full recovery mode did the same thing, started returning the same error:     The transaction log for database 'database_name' is full due to 'XTP_CHECKPOINT'   I tried to change the log growth settings to unlimited growth, but it wouldn't let me, returning the same error.  I can reproduce the problem without any XTP stuff at all, except for just the filegroup. Here's how:
I know that a continuous function which is a BV may not be absolutely continuous.  Is there an example of such a function?   I was looking for a BV whose derivative is not Lebesgue integrable but I couldn't find one. What is the "?" symbol in URL used for in php? Holomorphic function has at most countably zeros Let $f$ be holomorphic in a domain $U$, then $f$ has at most countably zeros.  How can I prove this statement? I have seen it in Sheng Gong  explicitly, but without any indications. Simulate limited bandwidth from within Chrome? Once it is compiled, is there a difference between:  delegate { x = 0; }   and  () =&gt; { x = 0 }   ? Should laptops remain plugged in when their battery is 100% charged? When your laptop's battery is 100% charged, should you leave it plugged in so any battery power doesn't get used, or will that cause overcharging, overheating, etc.? Should the laptop be unplugged when the battery level is 100%?  I'm asking because my laptop's screen tends to get dim when unplugged, so I don't like to run it on battery. Rotation Path Not Shown in Graph Editor I created a couple of LocRot keyframes but the rotation path and keyframes aren't shown in the graph editor (no, they aren't hidden). If $I$ and $J$ are ideals in a ring $R$ with $1$ such that $I+J = R$, show that $I^m$ and $J^n$ are co-maximal for all $m,n \in \mathbb{N}$ If $I$ and $J$ are ideals in a ring $R$ with 1 which are  co-maximal, i.e $I+J = R$, show that $I^m$ and $J^n$ are co-maximal for all $m,n$ in $\mathbb{N}$  Work done:     Should I proceed using    By taking $$K=I^m+J^m \neq R$$  Let $$S=\{I,J \in R \mid I^m+J^n \neq R \}$$ be the required partially order set ordered by inclusion then  $$I+J \subseteq I^n+J \subseteq I^n+J^m \subseteq \ldots $$  Then, I think this chain doesn't have an upper bound...as $I^m+J^n \neq R$ for all $ m,n \in \mathbb N$. Am I right??  Thanks for any help!! Cannot sort on numeric field with SOQL in Custom Metadata Cannot sort on a soql-request in a custom meta data type. When i perform SELECT .. FROM x__mdt WHERE ... ORDER BY x. Then field x cannot be numeric to get a correct order. Change it to a string-field ordering works ok. Playing with ASC/DESC makes no difference! Quantum information references "It is they who lied" or "it is them who lied?" Which is the correct usage of the third person, plural pronoun?     It is they who lied.   It is them who lied. Will wolves attack Ocelots? Will wolves attack and kill ocelots in Minecraft? I know they kill sheep. I just don't want my cats being eaten. Groups of order $pq$ without using Sylow theorems Can an electron be in two places at the same time? So I've been reading a bit and watching some videos about the double slit experiment, and therefore the wave particle duality; I've also read this "implies" that a particle can be in two places at the same time. Can you clarify this, and how could that be possible? Increase the highlighted button bezel thickness (GNOME) How to run grep on a single column? Is it possible to see the history of changes to a particular line of code in a Subversion repository?  I'd like, for instance, to be able to see when a particular statement was added or when that statement was changed, even if its line number is not the same any more. Why didn't Skynet kill Kyle Reese? Can I choose to use only Shapiro-Wilk? $N(ab) \geq N(a)$ is not necessary for the ring to be euclidean The definition of euclidean ring in my textbook is 1) $N(ab) \geq N(a)$ 2) Euclidean algorithm works. However there is a note that the first condition is not necessary. There is a hint that we can choose a following norm: $N'(a) = \min_{b\sim a} N(b)$. I do not understand why it works. We need to check that euclidean algorithm still works with this norm.   I tried to do the following. If $a \sim b$, then $a = bx, x \in K^*$. Let $N'(a)$ be $N(ax)$. Let us divide $ax$ by $bx$ instead of $b$. We get $ax = bxq + rx$, $N(rx) \leq N(bx)$. Here I am stuck and have no idea how to continue.