Kmin logo

Khám phá kỹ năng

Mỗi vị trí cần những kỹ năng nào, kiến thức nằm sau chúng và cách chúng kết nối với nhau

Database DeadlockDecision ProblemAbstract ClassAbstract Data TypeAccess ModifierAccessor MethodACID PropertiesAdjacency ListAdjacency MatrixAlgorithmAlgorithm CorrectnessAliasingALTER TABLE StatementAmortized AnalysisApplication Transaction ManagementArithmetic OperatorsArrayArray IndexingArray SlicingAssertionAssignmentAssociationAssociative ArrayAttribute ClosureAttribute DomainB-Tree IndexBacktrackingBellman-Ford AlgorithmBest, Worst and Average CaseBig-O NotationBig-Omega NotationBig-Theta NotationBinary HeapBinary RepresentationBinary SearchBinary Search TreeBinary TreeBitmap Index ScanBooleanBoyce-Codd Normal FormBreadth-First SearchBubble SortBuffer PoolBuffer Replacement PolicyByteBytecodeCall StackCandidate KeyCandidate Key DerivationCardinality RatioCharacterCHECK ConstraintClassClass DiagramClass InvariantClient-Server Database ModelClustered IndexCode BlockCode SmellCode TracingCohesionCollection LoopCommon Table ExpressionComparison OperatorsComparison Sort Lower BoundCompilationComplexity Class NPComplexity Class PComposite AttributeComposite IndexComposition over InheritanceConditional ExpressionConditional StatementConnected ComponentConnection PoolingConstantConstructorConstructor ChainingContiguous Memory LayoutCorrelated SubqueryCost-Based OptimizationCounted LoopCouplingCovering IndexCREATE TABLE StatementCycle DetectionData IndependenceDeclarative QueryingBackend DeveloperData TypeDatabase BlockDatabase CatalogDatabase Connection LifecycleDatabase DriverDatabase IndexDatabase StatisticsDatabase Management SystemDatabase SchemaDecompositionDatabase TransactionDatabase ViewDefault ArgumentDelegationDenormalizationDependency InjectionDependency Inversion PrincipleDependency PreservationDependency RelationshipDepth-First SearchDequeDesign PatternDestructorDijkstra's AlgorithmDirty Read AnomalyDivide and ConquerDo-While LoopDocument DatabaseDoubly Linked ListDowncastingDROP TABLE StatementDuck TypingDynamic ArrayDynamic DispatchDynamic ProgrammingDynamic TypingEdge CaseEdit-Run CycleEncapsulationEntity IntegrityEntity-Relationship ModelEntity TypeEnumerationEquality-Hash ContractER-to-Relational MappingError MessageException HandlingEXPLAIN CommandExpressionFactory PatternFieldFile Input and OutputFinalizerFirst Normal FormFloating-Point NumberFloating-Point Precision ErrorFlowchartForeign KeyFOREIGN KEY ConstraintFragile Base Class ProblemFunctionFunction CallFunction ContractFunctional DependencyGarbage CollectionGraphGraph DatabaseGreedy-Choice PropertyGreedy MethodHash CollisionHash FunctionHash IndexHash JoinHash TableHeap File OrganizationHeap MemoryHeapifyHeapsortHypothesis-Driven DebuggingImmutabilityIn-Place AlgorithmIndex ScanInformation HidingInheritanceInsertion SortIntegerInteger DivisionInteger OverflowInterface Segregation PrincipleInterface TypeInterpretationJunction TableKey-Value StoreKruskal's AlgorithmLinear SearchLinked ListLiskov Substitution PrincipleLoad FactorLogic ErrorLogical OperatorsLoopLoop Control StatementsLoop InvariantLossless-Join DecompositionMachine CodeMain MemoryMaster TheoremMemoizationMemory AddressMerge JoinMerge SortMethodMethod OverridingMethod ReceiverMinimal Reproducible ExampleMinimum Spanning TreeModification AnomaliesMulti-Version Concurrency ControlMultidimensional ArrayMultiple InheritanceMultivalued AttributeNamed ArgumentNested LoopNested Loop JoinNominal TypingNon-Repeatable Read AnomalyNoSQL Data ModelsNOT NULL ConstraintNP-CompletenessNP-HardnessNullObjectObject AggregationObject CompositionObject DiagramObject EqualityObject LifetimeObject-Relational Impedance MismatchObject-Relational MappingObserver PatternOff-by-One ErrorOpen AddressingOpen/Closed PrincipleOperator OverloadingOperator PrecedenceOptimal SubstructureOrder of GrowthOut-of-Bounds AccessOverlapping SubproblemsParameterParameterized QueryParticipation ConstraintPass by ReferencePass by SharingPass by ValuePhantom Read AnomalyPolymorphismPolynomial-Time ReductionPrimary KeyPRIMARY KEY ConstraintPrim's AlgorithmPriority QueueProblem SpecificationProgramProgram to an InterfacePseudocodeQuery Execution LifecycleQuery Parsing and Semantic AnalysisQueueQuick SortRAM Model of ComputationRead Committed IsolationRecurrence RelationRecursionRecursion Tree MethodRefactoringReference EqualityReference SemanticsReferential ActionsReferential IntegrityRelationRelational AlgebraRelational AttributeRelational Cartesian ProductRelational Operator TreeRelational ProjectionRelational SelectionRelational TupleRelationship TypeRepeatable Read IsolationReplace Conditional with PolymorphismResource OwnershipResponsibility-Driven DesignReturn ValueRETURNING ClauseRuntime ErrorSchema on ReadScopeScoped Cleanup ConstructSecond Normal FormSecondary IndexSelection SortSelf-Balancing Binary Search TreeSelf-Referencing RelationshipSemanticsSemi-Structured Data in Relational SystemsSeparate ChainingSequential ExecutionSequential ScanSerializable IsolationSerialization AnomalySet Semantics vs. Bag SemanticsShallow and Deep CopyShortest Path ProblemSide EffectSingle Responsibility PrincipleSlotted Page ArchitectureSort StabilitySorting AlgorithmSource CodeSpace ComplexitySpace-Time TradeoffSQL Aggregate FunctionsCASE ExpressionSQL Data TypesSQL DELETE StatementEXISTS OperatorGROUP BY ClauseHAVING ClauseIN OperatorSQL InjectionSQL Inner JoinSQL INSERT StatementLIMIT and OFFSETSQL NULLSQL NULL FunctionsORDER BY ClauseSQL Outer JoinSELECT StatementSQL Set OperationsSQL SubquerySQL UPDATE StatementWHERE ClauseStackStandard Input and OutputStatementStatic MemberStatic TypingStorage LifetimeStrategy PatternStringStrongly Connected ComponentStructStructural TypingSubstitution MethodSuperkeySurrogate Key vs. Natural KeySwitch StatementSyntaxSyntax ErrorTabulationTail RecursionTell, Don't AskTemplate Method PatternThird Normal FormThree-Valued LogicTime ComplexityTopological SortTransaction AtomicityTransaction BoundariesTransaction ConsistencyTransaction DurabilityTransaction IsolationTransaction Isolation LevelsTreeTree TraversalTrieTruthinessTwo-Phase LockingType CoercionType ConversionType InferenceUninitialized VariableUnion-FindUNIQUE ConstraintUpcastingUPSERTValue ObjectValue SemanticsVariableVariable DeclarationVariable InitializationVirtual FunctionWeak Entity TypeWhile LoopWide-Column StoreAlgorithm Design TechniquesAlgorithm FoundationsArraysBackend Application Architecture & Design PatternsBackend EngineeringBrowser Events & Event-Driven ProgrammingClasses & ObjectsComplexity AnalysisComputational Complexity TheoryComputer ScienceControl FlowData Integrity & ConstraintsConceptual Data Modeling & ER DesignData Structures & AlgorithmsData Types & ExpressionsApplication Database Access & IntegrationDatabase Architecture & SystemsStorage, Buffer Management & IndexingTransactions, Concurrency & Migrations in BackendsDatabasesDebuggingDesign PatternsDocument Object Model & Tree TraversalEncapsulation & InvariantsFunctionsGraphs & Graph AlgorithmsHashingHierarchical Data StructuresInheritance HierarchiesLinear Data StructuresMemory ModelMobile Architecture Patterns & Dependency InjectionMobile Application DevelopmentMobile Local Data & Offline StorageMobile Platform Architecture & SandboxingDevice Capabilities, Permissions & Mobile SecurityNon-Relational Databases & Data ModelsDatabase Normalization & Functional DependenciesCopying, Equality & Value TypesObject Lifetime & OwnershipObject-Oriented Programming & DesignObject RelationshipsObject-Oriented Design PrinciplesPointers & Memory ManagementPolymorphism & AbstractionProblem Solving & Program DesignPrograms & ExecutionProgrammingFirst Principles of ProgrammingQuery Processing & OptimizationApplication Architecture & RoutingReact & Modern Web Application DevelopmentState Architecture & Form HandlingRelational Model & Relational AlgebraServer Data Access & Connection PoolingSorting & SearchingSQL Querying & Data ManipulationSQL Data Definition & Schema ManagementStructsTransactions & Concurrency ControlVariablesWeb DevelopmentData Structures and AlgorithmsDatabase DesignDebuggingObject-Oriented DesignObject-Oriented ProgrammingProgramming FundamentalsRelational DatabasesSQL
Vị trí công việc
Kỹ năng
Kiến thức
Lĩnh vực
Nét càng đậm càng quan trọng
Rê chuột lên đường nối để xem chúng liên hệ thế nào

Về vị trí này

Backend Developer

Mid-level backend engineer responsible for designing scalable server applications, creating relational database schemas, managing database transactions, and writing efficient business algorithms.

8
Kỹ năng
384
Kiến thức

Kỹ năng quan trọng nhất

Bắt đầu từ đâu

Những kỹ năng không cần kỹ năng nào khác trước.

Tài nguyên học

Khoá học4
Dự án thực hành0
Bài kiểm tra0
Mentor0