Designing a Database Application with OOP
I often develop SQL database applications using Linq, and my methodology is to build model classes to represent each table, and each table that needs inserting or updating gets a Save() method (which either does an InsertOnSubmit() or SubmitChanges(), depending on the state of the object). Often, when I need to represent a collection of records, I’ll create a class that inherits from a List-like object of the atomic class.
Is comparing an OO compiler to a SQL compiler/optimizer valid?
I’m now doing a lot of SQL development at my new job where as before I was doing Object Oriented desktop app stuff. I keep running across very large scripts (thousands of lines) and wanting to refactor in some way. I am seeing that SQL is a different sort of beast and it’s probably fine to have these big scripts for the most part but while explaining this to me people are also insisting that the whole idea of refactoring is bad. That stuff like the .NET compiler are actually burdened by refactored code and that a big wall of code is more efficient and better design than code designed for reuse, readability and scalability.
Is it conceivable to have millions of lists of data in memory in Python?
I have over the last 30 days been developing a Python application that utilizes a MySQL database of information (specifically about Norwegian addresses) to perform address validation and correction. The database contains approximately 2.1 million rows (43 columns) of data and occupies 640MB of disk space.
Expensive AOT Optimizations
I’ve seen it stated several times that AOT can run some more expensive optimizations that take too long to be used by a JIT. But I’ve never seen it stated what exactly these optimizations are. So I’m wondering, what are these optimizations?
What performance topics should I be aware of? [closed]
It’s difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. Closed 11 years ago. When coding performance-critical portions of code (not necessarily […]
Turning n-dim points into m-dim where m<n and where point-to-point distance deviation is minimized
I want to apply k-means clustering to a (sparse) adjacency graph. For this I need to assign the nodes to a position in an euclidean space. Trivially I can do this by having a space with as many dimensions as there are nodes where each component corresponds to another node.
How can I plan optimization tasks in Scrum?
Recently my Scrum team has received several requests for optimizing certain parts of our code. Looking at the software with a profiler found some spots where the code could be improved.
Can profiling be used to verify if optimization was successful?
I know that profiling is useful to identify bottlenecks and determining what parts of the code require how much time to execute. The latter isn’t always very easy to track in the midst of other paths being executed, so once I decide what I want to optimize it might be problematic to see the improvement in numbers. This is especially true in desktop apps which run constantly and it is difficult to: execute the same path and execute it the same number of times to have reliable comparison.
Performance and other issues with using floating point types in C++
Being interested in C++ performance programming there is one aspect I really have no clue about- and that is the implications of using floating point calculations vs doubles vs normal integer mathematics?
using ant colony algorithm to create cross word game [closed]
Closed 11 years ago.