Database

Yes, that would be the best way... why can't I remember those things? Thank you very much for your help!

You can try pocketbase, https://pocketbase.io/ I've been using it for a year and its quite awesome and has as REST-ish API also. All the best.

when you are fixing the msoledbsql issue, make sure the OLE DB provider matches your SQL Server version and that all necessary Visual C++ Redistributables are installed.

I'll give this a try when I'm back in my office. The difficult we do right away... ...the impossible takes slightly longer.

Hi Rene, I have no experience with kdb+, and I don't know if it works with your development tools. I went to a couple of live demonstrations of it a few years ago. There is a "Q" programming language that was similar to SQL, and less verbose. I can't remember if it was aggregation, but the speed was incredible. You might want investigate it: kdb+ | KX[^] Hope that helps. Quote: Richard Rogers LinkedIn: https://www.linkedin.com/in/rrcdn/

Thanks, Richard! The difficult we do right away... ...the impossible takes slightly longer.

Thanks, Richard. I'm frankly surprised that there's no documented way to return only specific result sets. I'll probably end up using the additional parameter to suppress output. Cheers. The difficult we do right away... ...the impossible takes slightly longer.

I got your point.

:laugh: Confirming the speed and mentality of government! :laugh: Asking questions is a skill CodeProject Forum Guidelines Google: C# How to debug code Seriously, go read these articles. Dave Kreskowiak

mike7411 wrote: time ... define ...

RedDk wrote: current FFB is now 72.0.2 Not sure where you're getting that from; the current release is 125.0.3, and even the ESR release is 115.x! If you're still running v72 or v68, then you are putting yourself at risk, since there have been a lot of security vulnerabilities patched since then. RedDk wrote: if I dare upgrade/update, my cache of "data" will be destroyed and all my bookmarks will be lost as well as my extensive history I've been using Firefox since a very early version, and have literally never seen that happen. Even the "refresh Firefox[^]" option would preserve your bookmarks, history, passwords, and cookies. If you're paranoid about losing your data, you can always backup your profile folder: Back up and restore information in Firefox profiles | Firefox Help[^] But presumably you're already doing that? "These people looked deep within my soul and assigned me a number based on the order in which I joined." - Homer

Member 16235420 wrote: Oracle Developer No that is not possible because there is no such thing. So you need to provide more specific detail. But if you are asking if you can call C# natively from PL/SQL I don't think that is possible. TSQL allows that (or did) but that of course is not Oracle. Maybe it is related to something in here. https://docs.oracle.com/en/database/oracle/oracle-database/21/clrnt/database-extensions-net-developers-guide.pdf[^]

jschell wrote: That phrasing is a misstatement about how it works. Please, explain. Please do? Pretty please? Do explain how it works? jschell wrote: A table storage in a database is quite complicated Nope, and quite well documented. jschell wrote: Often, but not always, records (rows) are inserted at the end of the table. Doesn't matter whether indexes exist or not. The reason for doing it that way is because it is faster. Tables are without any inherent order, by design and definition. Indexes aren't in the table, they are entities outside the table that may be updated. jschell wrote: After the insert the index(es) are updated. That involves storing some of the data from the row (columns in the index) and a pointer to the row itself. Hence, the "create index" expects some columns to sort on. jschell wrote: Sorting is not something that is related to the table nor even to indexes If you need not sort, you need no index. So yes, it might be a tad related. The definition in proper schooling talks more about lookups than sorting, as that is more common. jschell wrote: In SQL you can specifically ask for a specific sort order Thanks for explaining that, that's really something new. Bastard Programmer from Hell :suss: "If you just follow the bacon Eddy, wherever it leads you, then you won't have to think about politics." -- Some Bell.

#include #include //Whence data //asynchronous programming

Copy/paste from the answer to the question that was posted before yours; Quote: That means the index is sorted on col1, then col2. Meaning, col1 will be located first, then most rows following with the same col1 will be sorted on col2. Meaning, in a list of users, while random stored in the table, would have an index that orders it as such; Lastname, Firstname Doe, Jane Doe, John Vluggen, Albert Vluggen, Eddy Vluggen, Zack If you search it, you go "where lastname = bla (col1 from index) AND firstname = bla2 (col2 from index)". This way, it will first locate the segment for "Vluggen", and only has to scan until it finds "Eddy" within that segment. That's what the DB is optimized to do. Bastard Programmer from Hell :suss: "If you just follow the bacon Eddy, wherever it leads you, then you won't have to think about politics." -- Some Bell.