US20040088307A1 - Data structure for information systems - Google Patents

Data structure for information systems Download PDF

Info

Publication number
US20040088307A1
US20040088307A1 US10/470,720 US47072003A US2004088307A1 US 20040088307 A1 US20040088307 A1 US 20040088307A1 US 47072003 A US47072003 A US 47072003A US 2004088307 A1 US2004088307 A1 US 2004088307A1
Authority
US
United States
Prior art keywords
data
elements
tree
type
data elements
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US10/470,720
Other languages
English (en)
Inventor
Axel Von Bergen
Arne Schwarz
Volker Sauermann
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
SAP SE
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Assigned to SAP AKTIENGESELLSCHAFT reassignment SAP AKTIENGESELLSCHAFT ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: VON BERGEN, AXEL, SCHWARZ, ARNE, SAUERMANN, VOLKER
Publication of US20040088307A1 publication Critical patent/US20040088307A1/en
Assigned to SAP AG reassignment SAP AG CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: SAP AKTIENGESELLSCHAFT
Assigned to SAP SE reassignment SAP SE CHANGE OF NAME (SEE DOCUMENT FOR DETAILS). Assignors: SAP AG
Abandoned legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2453—Query optimisation
    • G06F16/24534—Query rewriting; Transformation
    • G06F16/24542—Plan optimisation
    • G06F16/24545—Selectivity estimation or determination
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/22—Indexing; Data structures therefor; Storage structures
    • G06F16/2228—Indexing structures
    • G06F16/2246—Trees, e.g. B+trees
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99931—Database or file accessing
    • Y10S707/99933—Query processing, i.e. searching
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99941—Database schema or data structure
    • Y10S707/99942—Manipulating data structure, e.g. compression, compaction, compilation
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99941—Database schema or data structure
    • Y10S707/99943—Generating database or data structure, e.g. via user interface

Definitions

  • the invention relates to a data structure for information storage systems, such as database systems.
  • data is stored in and retrieved from some medium, such as a memory and a hard disk drive.
  • the data is stored in a data structure such as for example a structure based on the relational model.
  • a data structure such as for example a structure based on the relational model.
  • a query optimiser for example a rule based optimiser or a cost based optimiser.
  • the rule based optimiser uses a set of predefined rules.
  • the cost based optimiser uses statistical information about the data to structure queries, by estimating the selectivity of each query component and leading the search path along the most selective components first. Even though using the known optimisers can shorten the average response time, the need exists for optimisers that optimise each specific query.
  • a goal of the invention is to provide a data storage system that is easy to set up and maintain. Another goal is to provide a data storage system that allows fast retrieval of data. Another goal of the invention is to provide a data storage system in which a query can be deterministically optimised.
  • the invention provides for a query optimiser according to claim 6 .
  • a query optimiser according to claim 6 .
  • FIG. 1 shows schematically the hierarchical structure of the system according to the invention
  • FIG. 2 shows a data type according to the invention
  • FIG. 3 shows an InfoType structure with an anchor and an InfoCell
  • FIG. 4 shows two InfoCells according to the invention
  • FIG. 5 shows an InfoCluster with three InfoTypes in a binary tree configuration
  • FIG. 6 shows an InfoCourse as a binary tree, sorted by the InfoType—Identification number
  • FIG. 7 shows a sub structure of 4-dimensionally linked InfoCell elements with a table of the represented content
  • FIG. 8 shows a double link Self Ring with numbers the element counter of the ring
  • FIG. 9 shows a number for the element counter of a multi dimensional structure
  • FIG. 10 shows a table as a 6 dimensional structure.
  • FIG. 11 shows cascading InfoBridges
  • FIG. 12 shows an InfoBridge with eight flags
  • FIG. 13 shows an example of a tree structure
  • FIG. 14 shows a simplification of FIG. 13,
  • FIG. 15 shows a first example
  • FIG. 16 shows a second example
  • FIG. 17 shows a third example
  • FIG. 18 shows the example from FIG. 17,
  • FIG. 19 shows the example from FIG. 17,
  • FIG. 20 shows the example from FIG. 17,
  • FIG. 21 shows a fourth example
  • FIG. 22 shows a fifth example
  • FIG. 23 shows a sixth example.
  • FIG. 1 a diagram is shown of the static hierarchy of a data system according to the invention.
  • the highest level in the data system is the InfoSystem level. Down from the top level one or more InfoAreas are connected to the InfoSystem.
  • the InfoSystem provides the system in run time with the algorithms necessary to operate the system.
  • the InfoSystem is connected to any number of InfoAreas through a linking element, which will be described hereinafter as an anchor. These InfoAreas can for example refer to logical units of the InfoSystem.
  • Each InfoArea is connected via a linking element (again an anchor as described hereinafter) to an InfoCluster.
  • each InfoCluster is connect to at least one InfoCourse and at least one InfoType, through respective linking elements such as anchors.
  • the InfoType can be seen as an attribute of a table; an InfoCourse starts always in an InfoCluster. If an InfoCourse stays within an InfoCluster with its addressed InfoCell elements, that correspond with a field of a table, then it is similar to a record of a table.
  • the InfoCell is found; this is the element on the lowest level in the hierarchical structure.
  • an anchor is created that is an instance of the type InfoCell also.
  • This anchor has the function to represent the structure of following InfoCell elements (see FIG. 2).
  • the anchor has, just as the InfoCell information carrier, seven pointers as will be explained.
  • FIG. 2 For the implementation of the levels below the InfoArea, i.e. the InfoCluster, the InfoCourse, the InfoType and the InfoCell use is made of a data element according to the invention as shown in FIG. 2.
  • the data element is shown schematically as an anchor, and is provided with a number of pointers. In this example the data element has three pairs and one single pointer. In the initial state as shown in FIG. 2 all pointers point to the anchor. This initial states is also the simplest of possible ring structures. Every pointer in the structure has a valid address, and cases of a non defined pointer (nil pointer) are avoided.
  • the pointers of the first pair are labelled LVR and RVR (Left Vertical Ring, respectively Right Vertical Ring), the pointers of the second pair are labelled LHR and RHR (Left Horizontal Ring, respectively Right Horizontal Ring), the pointers of the third pair are labelled LSR and RSR (Left Self Ring, resp. Right Self Ring), and the single pointer is labelled IF (InFormation bridge). Note that the pointers LSR, RSR and IF are in principle optional.
  • FIG. 7 a table A is shown, containing data regarding first names, ages and weights.
  • an InfoCluster is generated.
  • three InfoTypes are generated to represent respectively first names, ages, and weights.
  • the use of the data element is shown for the implementation of the InfoType.
  • the InfoType semantic information is comprised such as the data type (in this example “INTEGER”), indication (in this example “age”)), etc.
  • the InfoType is an anchor associated with the InfoType.
  • the anchor points with its RVR pointer to the actual information carrier, that is the InfoCell.
  • the InfoCell is as described above the lowest level entity within the data system.
  • the InfoCell holds the information, as shown in FIG. 3; in this example “age is 30 in INTEGER”.
  • the InfoCell is as described above provided with a LVR/RVR pointer pair. As shown in FIG. 3, the RVR pointer of the InfoCell points towards the anchor, and also the LVR pointer points to the anchor. As a result, the ring configuration of the anchor is maintained.
  • FIG. 4 In FIG. 4 is shown how a further InfoCell is added to the data structure.
  • the InfoCell (with the value “25”) is inserted in the LVR ring after the first InfoCell.
  • the LVR and RVR pointers of the InfoCell point to the anchor, as to maintain a closed ring.
  • the order in which the InfoCells are organized depends on their value. In case of a smaller value, the InfoCell is ordered in on the LVR side, otherwise on the RVR side.
  • This practise is well known in the art as binary tree building.
  • the binary trees are organized as balanced or AVL trees, methods which are well known in the art. These kind of trees minimise the number of levels within the tree structure, so as to minimize access time.
  • all tree structures within the data system are dynamically balanced in use, so as to guaranty optimum access times.
  • FIG. 5 the structure is shown that is obtained when all InfoTypes of the table A are put into the data structure. In total three InfoTypes are present; age, first name and weight. Note that the end pointers of each last element in the respective trees are not shown. Under each anchor of the InfoType, the InfoCells are organised in a binary tree. The InfoCluster points to an anchor which in turn points to a first InfoType. The first InfoType in turn points to the other two InfoTypes. Each InfoType points to an anchor. The anchor has the additional function of a marker, that can be used by an access or query process as a break or return sign.
  • the relations between the InfoType have to be made.
  • an InfoCourse is introduced.
  • the InfoCourse is shown that contains the data for the fourth line of the table. Use is made of the LHR and RHR pointers. The end pointers again point back to the anchor of the InfoCourse to maintain the ring structure.
  • the InfoCourse also forms a binary tree, sorted by the ID numbers of the InfoTypes. Note that the ID numbers of the InfoTypes are unique, and that integer values are used.
  • FIG. 7 all the InfoCourse paths (for example implemented using pointers) are shown for the table A. Note that all InfoCells have been provided in the top section with their respective InfoType Id number, over which the binary tree configuration of the InfoCourse via the LHR/RHR pointers is organized.
  • the other, older elements have a historic value (i.e. lower value) as these values are not updated during insertion of a new element in the ring.
  • An additional feature is further that a element counter is attributed to each InfoCell.
  • the element counter is indicated in FIG. 9 in the box indicated next to the elements.
  • the element counter is defined as the total of the number of elements that can be reached over the pointers LVR/RVR and LSR/RSR, that is the number of elements in the self ring (if any) plus the number of elements in the tree under the respective element.
  • the number of elements in the self ring is already known in the master element itself, and the elements down in the tree follow simply from the element counter of the elements pointed to by the LVR and RVR pointers. In principle there is no need to actually go through the tree to determine the number of relevant elements.
  • the determination of the element counter as well as the self ring element counter are done initially during the mounting of the data structure, and also when elements are added or deleted.
  • the element counter is representative for the potential number of elements that have to be searched in a potential search over this element, or the resources needed for such a search.
  • a table B is shown as a 6-dimensional structure. All counters and identification numbers are shown for each node. Anchor elements and pointers associated with the anchors (such as for example the pointers that form the closed loop structure) are not shown.
  • the structure of the InfoType can have the functionality of a previously defined set, so that elements can appear in the InfoType tree that are not included in any InfoCourse. In case an element in an InfoType tree is needed by more than one InfoCourse, it is preferable to make additional InfoType structures for each InfoCourse so that the structure stays definite.
  • the pointer IF of the data element according to the invention can be used for each instance of any object type.
  • the pointer IF can point to any type of instance; the type of the instance that it points to can be determined from the context or an indicator. That can be for example a list of flags (shown in FIG. 12) or for example a condition graph (as known from theory) for each node.
  • the pointer is more efficient as it does not require so many bits, whereas a condition graph has the advantages that it offers-to include semantic information to enhance the data structure.
  • An InfoBridge is a connection element, looking like an Y adapter, that can be cascaded (FIG. 11).
  • the InfoBridge can bi-directional, so that any network can be represented over the basic structure.
  • the Pointer IF has a further use. Operations within a data structure change on the whole many data elements at the same time. On micro level however, all the changes take place sequentially. An operation is carried out for instance with a Commit work or a Rollback (these operations are known from the SAP R/3 system). This means that both the original (unchanged) value and the target (changed) value have to be kept temporarily in the memory until the transaction has been fully completed.
  • An InfoBridge can be used to connect both values together. An example is shown in FIG. 12. The upper InfoBridge connects two InfoCells with each other. By adding an InfoBridge all functionality is kept, and can be augmented by a cascade as is shown by the shaded InfoBridge in FIG. 12.
  • InfoCourse relates to a data record definition that is expressed in a table
  • use of an InfoCourse is not limited to this.
  • An InfoCourse can for example extend over unlimited InfoTypes of various InfoClusters or even InfoAreas. In this way it is also possible to ensure referential integrity. It is for example not necessary to copy values of a test table into the application table (as is usual for known databases). Instead, the respective InfoCell will be given as value a pointer to the InfoCell of the InfoCluster that is used as the test table.
  • Query optimisers are used to determine the query route that has the shortest estimated runtime.
  • the invention can be implemented in particularly in a random access memory (RAM), wherein the addresses can be randomly accessed.
  • RAM random access memory
  • the use of a random access memory also has the advantage that changes to the data structure do not effect efficiency in any way.
  • the invention is preferably implemented in a random access memory, the implementation is not limited to this form, and other implementations in memory devices are possible.
  • the ring pointer structure is used, including the pointers that lead back to a ring (LVR/RVR) and self rings.
  • the pointers are represented by small anchor symbols.
  • FIG. 14 the structure of FIG. 13 is shown, with the relations of the binary tree structure, that underlies the structure of FIG. 13, in case that no multiple identical elements are assumed. In the following, a number of examples of search queries are shown.
  • Goal is to find a data element with key 54 .
  • the search starts at the position 1 (arrow with 1 in FIG. 15), which is just after the anchor shown in FIG. 13.
  • the search is similar to a search in a binary tree, and the InfoCells are visited in turn, i.e. the tree is descended, wherein the consecutive InfoCells are indicated by the arrows 1 to 5 . With 5 the respective element is found.
  • This InfoCell is, as other InfoCells, provided with a pointer pair LHR and RHR. From the InfoCell neighbouring semantic information can be acquired of the InfoCourse. As the InfoCourse pointers also are organised as a ring tree, can always the starting anchor of the InfoCourse be reached. From this starting anchor every element in the InfoCourse structure can be reached. To further enhance the performance, an additional pointer can be added to each InfoCell that points directly to this InfoCourse anchor. Using this pointer it is not necessary to go fully down through the InfoCourse tree to reach this anchor.
  • the query is to find the shaded subset of the tree (FIG. 16), that fulfils the condition key ⁇ 20. Again, the search is started at position 1 , and the tree is followed down (using known techniques as before) to end at position 3 .
  • the search is started at position 1 , and the tree is followed down (using known techniques as before) to end at position 3 .
  • the InfoCell 10 is provided with an element counter (X 1 ) indication, that exactly tells how many elements follow in this section of the tree.
  • FIG. 17 is shown how a number of hits can be determined for a search in the database structure.
  • the search in the tree is started with position 1 , and leads to position 2 , where the query criterion is fulfilled.
  • the element counter x 1 can however not be used directly, as also cells are included that do not meet the criterion (i.e. 30 and 35 ).
  • the path is followed from position 2 to position 3 (FIG. 18), where the element counter yl is found. From this position the path leads further to position 4 , where the element counter x 2 is found (FIG. 19).
  • the search is completed, and the exact number of hits for the query key ( ⁇ 28) can be calculated by respective addition and subtraction of the found element counters x 1 , y 1 , and x 2 (FIG. 20), to yield the number of cells within the shaded area that represents the target group of cells. Note that with a relatively small number of steps one path down in the tree structure, the number of hits the query yields is determined deterministically, yielding an exact number of cells.
  • the search optimiser can make a search plan, based on actual facts.
  • FIG. 21 the same logical analysis as was made for example 3 is shown for a further example, with a query key >10.
  • the search is started with position 1 , which immediately yields the first results in the form of the shaded area.
  • the search goes then to position 2 , where the second shaded area is determined.
  • the number of hits is calculated in the same way as in the previous examples, i.e. by adding and subtracting element counters depending on whether they should be taken into account or not.
  • FIG. 22 is a query shown that needs two searches trough the tree structure to determine the number of hits.
  • the tree is entered at 40 , so both left and right branches have to be searched, more specific, the left branch with the lower value of 24 and the right branch with the upper value of 54.
  • the circled set of cells meeting the criteria of the query are identified.
  • the example has the compound query criterion:
  • key_ 1 ⁇ 28 and key_ 2 > value_ 2 and key_ 3 ⁇ value_ 3
  • the optimiser determines how many hits are obtained in each section of the query. Based on the number of hits, the optimiser will process query sections with the lowest number of hits first and those with higher numbers of hits later.
  • the first section of the query matches the example shown in FIG. 17.
  • a temporary instance of an object of the type Guide is made that stores the address of the position 2 .
  • an iteration value It made (which is similar to FIG. 23), that stores the number of actual valid cells in a sub tree. This value It can be later used as the end criterion for an algorithm for traversing of the sub tree. This saves the comparison of the search criterion to the cell values, as the end criterion is reached after visiting all the valid cells in the tree section.
  • the comparison is faster than comparing the actual value of a cell, which cell could be a long character chain.
  • the optimiser can use the linear list of Guides to access directly the trees with valid cells. Note that the linear lists for the other parts of the criterion are discarded, but this does not lead to increased processing time.
  • the optimiser according-to the invention determines the search path based on the exact determination of the number of hits that are obtained with the respective parts of a search criterion. In this way the determination of the search path yields always the most optimal choice.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Software Systems (AREA)
  • Operations Research (AREA)
  • Computational Linguistics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Circuits Of Receivers In General (AREA)
  • Hardware Redundancy (AREA)
US10/470,720 2001-02-01 2002-02-01 Data structure for information systems Abandoned US20040088307A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE10104831.9 2001-02-01
DE10104831A DE10104831A1 (de) 2001-02-01 2001-02-01 Datenstruktur für Informationssysteme
PCT/EP2002/001026 WO2002061612A2 (en) 2001-02-01 2002-02-01 Data structure for information systems

Publications (1)

Publication Number Publication Date
US20040088307A1 true US20040088307A1 (en) 2004-05-06

Family

ID=7672701

Family Applications (3)

Application Number Title Priority Date Filing Date
US10/470,720 Abandoned US20040088307A1 (en) 2001-02-01 2002-02-01 Data structure for information systems
US10/470,716 Abandoned US20040093329A1 (en) 2001-02-01 2002-02-01 Database system and query optimiser
US10/637,004 Expired - Lifetime US7257599B2 (en) 2001-02-01 2003-08-08 Data organization in a fast query system

Family Applications After (2)

Application Number Title Priority Date Filing Date
US10/470,716 Abandoned US20040093329A1 (en) 2001-02-01 2002-02-01 Database system and query optimiser
US10/637,004 Expired - Lifetime US7257599B2 (en) 2001-02-01 2003-08-08 Data organization in a fast query system

Country Status (8)

Country Link
US (3) US20040088307A1 (ja)
EP (2) EP1393206B1 (ja)
JP (2) JP2004518226A (ja)
AT (2) ATE487186T1 (ja)
AU (2) AU2002249161B2 (ja)
CA (1) CA2434081C (ja)
DE (3) DE10104831A1 (ja)
WO (2) WO2002061612A2 (ja)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7752229B2 (en) 2007-01-26 2010-07-06 International Business Machines Corporation Real-time identification of sub-assemblies containing nested parts
US20160277199A1 (en) * 2015-03-20 2016-09-22 Juniper Networks, Inc. Pim source discovery by last hop router
US9998292B2 (en) 2015-09-30 2018-06-12 Juniper Networks, Inc. PIM source discovery by last hop router on shared tree

Families Citing this family (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6785668B1 (en) * 2000-11-28 2004-08-31 Sas Institute Inc. System and method for data flow analysis of complex data filters
DE10104831A1 (de) 2001-02-01 2002-08-08 Sap Ag Datenstruktur für Informationssysteme
JP2006508643A (ja) 2002-07-01 2006-03-16 アーキオン ライフ サイエンシーズ エルエルシー ディー／ビー／エー バイオ−テクニカル リソーセズ ディビジョン グルコサミンおよびｎ−アセチルグルコサミン製造のためのプロセスおよび材料
US7610582B2 (en) 2003-04-18 2009-10-27 Sap Ag Managing a computer system with blades
US7590683B2 (en) 2003-04-18 2009-09-15 Sap Ag Restarting processes in distributed applications on blade servers
DE60330955D1 (de) * 2003-07-08 2010-03-04 Sap Ag Verfahren und Computersystem zur Abfrageverarbeitung
ATE483205T1 (de) * 2003-07-17 2010-10-15 Sap Ag Verfahren und computersystem zum speichern von mehrfachen attributwerten
EP1498829B1 (en) * 2003-07-18 2011-08-31 Sap Ag Method and computer system for aggregating information
US7310719B2 (en) 2003-07-24 2007-12-18 Sap Aktiengesellschaft Memory management tile optimization
US7337295B2 (en) 2003-07-24 2008-02-26 Sap Aktiengesellschaft Memory management frame handler
EP1503297A1 (en) * 2003-07-30 2005-02-02 Sap Ag Computer implemented methods of retrieving hit count data from a data base system and according computer program product
EP1510933B1 (en) 2003-08-27 2007-08-01 Sap Ag Propagating of database modifications
EP1510932A1 (en) 2003-08-27 2005-03-02 Sap Ag Computer implemented method and according computer program product for storing data sets in and retrieving data sets from a data storage system
US20060101018A1 (en) * 2004-11-08 2006-05-11 Mazzagatti Jane C Method for processing new sequences being recorded into an interlocking trees datastore
US8706686B2 (en) * 2003-12-24 2014-04-22 Split-Vision Kennis B.V. Method, computer system, computer program and computer program product for storage and retrieval of data files in a data storage means
GB2431742A (en) * 2005-10-27 2007-05-02 Hewlett Packard Development Co A method of retrieving data from a data repository
US20070118510A1 (en) * 2005-11-18 2007-05-24 Microsoft Corporation Optimization of leaf-level multi-dimensional calculation using scripts
US8738639B1 (en) * 2006-02-23 2014-05-27 Verizon Data Services Llc Methods and systems for an information directory providing audiovisual content
US9367553B2 (en) * 2006-12-30 2016-06-14 Sap Se Computer file system traversal
US8112388B2 (en) * 2007-08-03 2012-02-07 Sap Ag Dependency processing of computer files
JP4834054B2 (ja) * 2008-11-19 2011-12-07 新日鉄ソリューションズ株式会社 情報処理装置、情報処理方法及びプログラム
US10564944B2 (en) * 2010-01-07 2020-02-18 Microsoft Technology Licensing, Llc Efficient immutable syntax representation with incremental change
US9009137B2 (en) * 2010-03-12 2015-04-14 Microsoft Technology Licensing, Llc Query model over information as a networked service
DE102011087843B4 (de) 2011-12-06 2013-07-11 Continental Automotive Gmbh Verfahren und System zur Auswahl mindestens eines Datensatzes aus einer relationalen Datenbank
US9781075B1 (en) * 2013-07-23 2017-10-03 Avi Networks Increased port address space
US9870417B2 (en) 2014-04-22 2018-01-16 Business Objects Software Ltd. Merging business object hierarchies
EP3091449B1 (en) * 2015-05-04 2018-07-25 Deloitte Consulting GmbH Operating a database system
US10671630B2 (en) 2016-05-09 2020-06-02 Sap Se External access to database container artifacts
US11093443B2 (en) 2017-06-29 2021-08-17 Sap Se Database-level container group management
US10984021B2 (en) 2017-06-29 2021-04-20 Sap Se Deployment of independent database artifact groups
US10776330B2 (en) 2017-06-29 2020-09-15 Sap Se Optimized re-deployment of database artifacts
US10674438B2 (en) 2017-06-29 2020-06-02 Sap Se Restricting access to external schemas from within a database level container by whitelisting allowed schemas
US10657114B2 (en) 2017-11-28 2020-05-19 Sap Se Reserving key specifications
US11030164B2 (en) 2018-01-18 2021-06-08 Sap Se Artifact deployment for application managed service instances

Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4829427A (en) * 1984-05-25 1989-05-09 Data General Corporation Database query code generation and optimization based on the cost of alternate access methods
US4956774A (en) * 1988-09-02 1990-09-11 International Business Machines Corporation Data base optimizer using most frequency values statistics
US5442784A (en) * 1990-03-16 1995-08-15 Dimensional Insight, Inc. Data management system for building a database with multi-dimensional search tree nodes
US5446886A (en) * 1992-03-12 1995-08-29 Ricoh Company, Ltd. System from optimizing query processing of multi-attribute distributed relations using local relation tuple numbers to choose semijoins
US5495605A (en) * 1992-01-12 1996-02-27 Bull S.A. Method to help in optimizing a query from a relational data base management system, and resultant method of syntactical analysis
US5548770A (en) * 1993-02-25 1996-08-20 Data Parallel Systems, Inc. Method and apparatus for improving retrieval of data from a database
US5581756A (en) * 1991-03-27 1996-12-03 Nec Corporation Network database access system to which builds a table tree in response to a relational query
US5598559A (en) * 1994-07-01 1997-01-28 Hewlett-Packard Company Method and apparatus for optimizing queries having group-by operators
US5664172A (en) * 1994-07-19 1997-09-02 Oracle Corporation Range-based query optimizer
US5666528A (en) * 1993-06-30 1997-09-09 Borland International, Inc. System and methods for optimizing database queries
US5758146A (en) * 1994-05-20 1998-05-26 International Business Machines Corporation Method and apparatus for optimizing data retrieval using index scanning
US5822747A (en) * 1996-08-23 1998-10-13 Tandem Computers, Inc. System and method for optimizing database queries
US6021405A (en) * 1996-08-23 2000-02-01 Tandem Computers, Inc. System and method for optimizing database queries with improved performance enhancements
US6175835B1 (en) * 1996-07-26 2001-01-16 Ori Software Development, Ltd. Layered index with a basic unbalanced partitioned index that allows a balanced structure of blocks
US6175836B1 (en) * 1997-10-09 2001-01-16 International Business Machines Corporation Optimization of relational database queries
US6675173B1 (en) * 1998-01-22 2004-01-06 Ori Software Development Ltd. Database apparatus

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4849905A (en) 1987-10-28 1989-07-18 International Business Machines Corporation Method for optimized RETE pattern matching in pattern-directed, rule-based artificial intelligence production systems
US5355473A (en) * 1991-06-20 1994-10-11 Lawrence Au Indexed record locating and counting mechanism
US5737732A (en) * 1992-07-06 1998-04-07 1St Desk Systems, Inc. Enhanced metatree data structure for storage indexing and retrieval of information
US5657437A (en) * 1993-12-10 1997-08-12 Lucent Technologies Inc. Data processing apparatus and method including proportional updating of data
US5557786A (en) * 1994-01-24 1996-09-17 Advanced Computer Applications, Inc. Threaded, height-balanced binary tree data structure
US5742806A (en) 1994-01-31 1998-04-21 Sun Microsystems, Inc. Apparatus and method for decomposing database queries for database management system including multiprocessor digital data processing system
US5659728A (en) * 1994-12-30 1997-08-19 International Business Machines Corporation System and method for generating uniqueness information for optimizing an SQL query
US5701400A (en) * 1995-03-08 1997-12-23 Amado; Carlos Armando Method and apparatus for applying if-then-else rules to data sets in a relational data base and generating from the results of application of said rules a database of diagnostics linked to said data sets to aid executive analysis of financial data
US5819255A (en) * 1996-08-23 1998-10-06 Tandem Computers, Inc. System and method for database query optimization
WO1999028505A1 (en) * 1997-12-03 1999-06-10 Curagen Corporation Methods and devices for measuring differential gene expression
US7016910B2 (en) * 1999-12-30 2006-03-21 Decode Genetics Ehf. Indexing, rewriting and efficient querying of relations referencing semistructured data
DE10104831A1 (de) 2001-02-01 2002-08-08 Sap Ag Datenstruktur für Informationssysteme

Patent Citations (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4829427A (en) * 1984-05-25 1989-05-09 Data General Corporation Database query code generation and optimization based on the cost of alternate access methods
US4956774A (en) * 1988-09-02 1990-09-11 International Business Machines Corporation Data base optimizer using most frequency values statistics
US5442784A (en) * 1990-03-16 1995-08-15 Dimensional Insight, Inc. Data management system for building a database with multi-dimensional search tree nodes
US5581756A (en) * 1991-03-27 1996-12-03 Nec Corporation Network database access system to which builds a table tree in response to a relational query
US5495605A (en) * 1992-01-12 1996-02-27 Bull S.A. Method to help in optimizing a query from a relational data base management system, and resultant method of syntactical analysis
US5446886A (en) * 1992-03-12 1995-08-29 Ricoh Company, Ltd. System from optimizing query processing of multi-attribute distributed relations using local relation tuple numbers to choose semijoins
US5548770A (en) * 1993-02-25 1996-08-20 Data Parallel Systems, Inc. Method and apparatus for improving retrieval of data from a database
US5666528A (en) * 1993-06-30 1997-09-09 Borland International, Inc. System and methods for optimizing database queries
US5758146A (en) * 1994-05-20 1998-05-26 International Business Machines Corporation Method and apparatus for optimizing data retrieval using index scanning
US5598559A (en) * 1994-07-01 1997-01-28 Hewlett-Packard Company Method and apparatus for optimizing queries having group-by operators
US5664172A (en) * 1994-07-19 1997-09-02 Oracle Corporation Range-based query optimizer
US6175835B1 (en) * 1996-07-26 2001-01-16 Ori Software Development, Ltd. Layered index with a basic unbalanced partitioned index that allows a balanced structure of blocks
US5822747A (en) * 1996-08-23 1998-10-13 Tandem Computers, Inc. System and method for optimizing database queries
US6021405A (en) * 1996-08-23 2000-02-01 Tandem Computers, Inc. System and method for optimizing database queries with improved performance enhancements
US6175836B1 (en) * 1997-10-09 2001-01-16 International Business Machines Corporation Optimization of relational database queries
US6675173B1 (en) * 1998-01-22 2004-01-06 Ori Software Development Ltd. Database apparatus

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7752229B2 (en) 2007-01-26 2010-07-06 International Business Machines Corporation Real-time identification of sub-assemblies containing nested parts
US20160277199A1 (en) * 2015-03-20 2016-09-22 Juniper Networks, Inc. Pim source discovery by last hop router
US9838303B2 (en) * 2015-03-20 2017-12-05 Juniper Networks, Inc. PIM source discovery by last hop router
US9998292B2 (en) 2015-09-30 2018-06-12 Juniper Networks, Inc. PIM source discovery by last hop router on shared tree

Also Published As

Publication number Publication date
US20040093329A1 (en) 2004-05-13
EP1393206A2 (en) 2004-03-03
AU2002249161B2 (en) 2005-05-19
JP2004518226A (ja) 2004-06-17
ATE316266T1 (de) 2006-02-15
WO2002061612A3 (en) 2003-11-27
ATE487186T1 (de) 2010-11-15
WO2002061613A3 (en) 2003-09-04
JP2004518225A (ja) 2004-06-17
WO2002061613A2 (en) 2002-08-08
DE60208778T2 (de) 2006-09-07
EP1360616B1 (en) 2010-11-03
DE60238179D1 (de) 2010-12-16
US20040139046A1 (en) 2004-07-15
JP3959027B2 (ja) 2007-08-15
CA2434081A1 (en) 2002-08-08
WO2002061612A2 (en) 2002-08-08
DE10104831A1 (de) 2002-08-08
EP1360616A2 (en) 2003-11-12
AU2002229734B2 (en) 2005-05-05
US7257599B2 (en) 2007-08-14
EP1393206B1 (en) 2006-01-18
CA2434081C (en) 2009-06-16
DE60208778D1 (de) 2006-04-06

Similar Documents

Publication Publication Date Title
AU2002249161B2 (en) Data structure for information systems
AU2002249161A1 (en) Data structure for information systems
EP1496449B1 (en) Method and computer system for query processing
KR100896528B1 (ko) 데이터 스트림으로부터 연관규칙을 생성하는 방법 및데이터 마이닝 시스템
JP3771271B2 (ja) コンパクト０完全木における順序付けられたキーの集まりの記憶と検索のための装置及び方法
US9092481B2 (en) Method and system for processing graph queries
AU2002229734A1 (en) Database system and query optimiser
US4930072A (en) Method for computing transitive closure
JP2002501256A (ja) データベース装置
CN105653691A (zh) 信息资源管理方法及管理装置
US7096235B2 (en) Computer implemented compact 0-complete tree dynamic storage structure and method of processing stored data
WO1999052098A2 (en) Deletion of ordered sets of keys in a compact 0-complete tree
US7512617B2 (en) Interval tree for identifying intervals that intersect with a query interval
RU2433467C1 (ru) Способ формирования структуры агрегированных данных и способ поиска данных посредством структуры агрегированных данных в системе управления базами данных
EP1496450A1 (en) Method and computer system for software tuning
DeHaan et al. Optimal top-down join enumeration (extended version)
Jea et al. A difference-based version model for OODBMS
Jeon et al. A low overhead index structure for dynamic main memory database management systems
JPH09305619A (ja) 階層インデックス検索装置、及び文書検索方法
Whang Property of separability in physical design of network model databases
JPH05313971A (ja) リレーショナル・データベースにおけるキーワード管理方式
JPH06250899A (ja) 検索装置及び検索方法

Legal Events

Date Code Title Description
AS Assignment

Owner name: SAP AKTIENGESELLSCHAFT, GERMANY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VON BERGEN, AXEL;SCHWARZ, ARNE;SAUERMANN, VOLKER;REEL/FRAME:014858/0494;SIGNING DATES FROM 20030902 TO 20030929

AS Assignment

Owner name: SAP AG,GERMANY

Free format text: CHANGE OF NAME;ASSIGNOR:SAP AKTIENGESELLSCHAFT;REEL/FRAME:017358/0778

Effective date: 20050609

Owner name: SAP AG, GERMANY

Free format text: CHANGE OF NAME;ASSIGNOR:SAP AKTIENGESELLSCHAFT;REEL/FRAME:017358/0778

Effective date: 20050609

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION

AS Assignment

Owner name: SAP SE, GERMANY

Free format text: CHANGE OF NAME;ASSIGNOR:SAP AG;REEL/FRAME:033625/0223

Effective date: 20140707