Results 11 to 20 of about 2,087,550 (284)
Improve Query Performance On Hierarchical Data. Adjacency List Model Vs. Nested Set Model [PDF]
Hierarchical data are found in a variety of database applications, including content management categories, forums, business organization charts, and product categories.
Cornelia Győrödi+3 more
openalex +2 more sources
An annotated check-list of Orthoptera of Tuva and adjacent regions. Part 1. Suborder Ensifera [PDF]
Sergeev, M.G., Storozhenko, S.Yu., Benediktov, A.A. (2018): An annotated check-list of Orthoptera of Tuva and adjacent regions. Part 1. Suborder Ensifera. Far Eastern Entomologist 372: 1-24, DOI: 10.25221/fee.372.1, URL: http://dx.doi.org/10.25221/fee.372 ...
М. Г. Сергеев+2 more
openalex +5 more sources
List Edge Colorings of Planar Graphs without Adjacent 7-Cycles
In this paper, we get that G is edge- k -choosable ( k = max
Wenwen Zhang
openalex +4 more sources
List of land mammals of New Guinea, Celebes and adjacent islands, 1758-1952 /
(Uploaded by Plazi for the Bat Literature Project) No abstract provided.
E. M. O. Laurie, J. E. Hill
openalex +3 more sources
A List of the Protozoa and Rotifera Found in the Illinois River and Adjacent Lakes at Havana, Ill.
The material studied in the preparation of this paper was collected at the Biological Experiment Station established on the Illinois River, at Havana, April 1, 1894, by the University of Illinois and the Illinois State Laboratory of Natural History.
Adolph Hempel
openalex +3 more sources
A list of scorpions found in the adjacent territories of Japan
Haruo Takashima
openalex +3 more sources
Check-List Of The Mammals of Louisiana And Adjacent Waters
George H. Lowery
openalex +4 more sources
Representation of graphs for storing in relational databases [PDF]
The article is devoted to the problem of representing graphs in the form that is most suitable for their recording in relational databases and for subsequent efficient extracting and processing.
Urubkin Mikhail+4 more
doaj +1 more source
The list of birds collected in Oriental and adjacent regions
Tadayuki Miyamoto
openalex +4 more sources
Spanning Adjacency Oracles in Sublinear Time [PDF]
Suppose we are given an $n$-node, $m$-edge input graph $G$, and the goal is to compute a spanning subgraph $H$ on $O(n)$ edges. This can be achieved in linear $O(m + n)$ time via breadth-first search.
Gregory Bodwin, Henry L. Fleischmann
semanticscholar +1 more source