US20170206188A1 - Manipulation of an ajax tree presentation - Google Patents

Manipulation of an ajax tree presentation Download PDF

Info

Publication number
US20170206188A1
US20170206188A1 US15/471,879 US201715471879A US2017206188A1 US 20170206188 A1 US20170206188 A1 US 20170206188A1 US 201715471879 A US201715471879 A US 201715471879A US 2017206188 A1 US2017206188 A1 US 2017206188A1
Authority
US
United States
Prior art keywords
tree
path array
ajax
array
node
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
US15/471,879
Inventor
Trevett B. Chusing
Lei Zhang
Jian Zhu
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.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
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
Priority to US11/968,278 priority Critical patent/US9632987B2/en
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Priority to US15/471,879 priority patent/US20170206188A1/en
Assigned to INTERNATIONAL BUSINESS MACHINES CORPORATION reassignment INTERNATIONAL BUSINESS MACHINES CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: CHUSING, TREVETT B., ZHU, JIAN, ZHANG, LEI
Publication of US20170206188A1 publication Critical patent/US20170206188A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • G06F17/2247
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/10Text processing
    • G06F40/12Use of codes for handling textual entities
    • G06F40/14Tree-structured documents
    • G06F17/2241
    • GPHYSICS
    • G06COMPUTING; CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00Handling natural language data
    • G06F40/10Text processing
    • G06F40/12Use of codes for handling textual entities
    • G06F40/137Hierarchical processing, e.g. outlines

Abstract

The present invention discloses a method for manipulating the presentation of an AJAX tree using an array representing the hierarchical path of a tree node. Such a method can begin with the receipt of a user-request to expand a selected tree node of an AJAX tree in a Web page. Next, it can be determined if the tree node is present in the existing path array. When the tree node is present in the existing path array, the existing path array can be modified for the selected tree node. A new path array can be requested from the AJAX engine when the tree node does not exist in the existing path array. A path array handler can be invoked to expand the AJAX tree using the existing path array.

Description

    BACKGROUND
  • Field of the Invention
  • The present invention relates to the field of Web page data presentation and, more particularly, to using an array representation of the hierarchical path of a tree node to enhance the manipulation of an HTML tree (e.g., an AJAX tree) in a Web page.
  • Description of the Related Art
  • The use of Asynchronous JavaScript and XML (AJAX) within Web pages and applications is increasing in popularity. AJAX allows for Web page content to be loaded and updated seamlessly without reloading the entire Web page. For example, a Web page can use AJAX to verify credit card information entered into a Web form before the user hits the submit button.
  • A popular use of AJAX is for presenting data in a tree structure. An AJAX tree allows for the incremental loading of the tree data into the Web page. For example, only the tree branch selected by a user for expansion is loaded into the Web page, not all branches of the tree. This approach provides a quick response for user interactions, increasing user satisfaction and usability.
  • Conventional implementations of AJAX trees use arrays of objects or text strings to represent the path of a user-selected tree node for expansion. However, these approaches require the request of a new object array or text string for every user-selected tree node, even if the selected tree node is contained within the path of the previously-selected tree node.
  • Further, these data structures require handlers for processing that addresses its special format, which often cannot be used with other implementations of AJAX trees. For example, Text String Parser A can only work with text strings from AJAX Engine A, which uses the same set of rules as Parser A, which can be incompatible with an AJAX Engine B.
  • What is needed is a general technique that enhances the manipulation of AJAX trees. That is, the technique would utilize an array data structure to define the path hierarchy of a user-selected tree node. Ideally, such a technique would extend the capabilities of existing AJAX tree implementations.
  • SUMMARY OF THE INVENTION
  • The present invention discloses a technique for manipulating the presentation of an HTML tree (e.g., AJAX tree) using an array representing the hierarchical path of a tree node. This technique can represent the hierarchical ancestry of a tree node in a path array data structure. The path array can be searched and modified to alter the presentation of the AJAX tree without having to send additional requests to the AJAX engine. The path can also be stored to save the current expanded state of the AJAX tree to accommodate the use of Web page navigation controls.
  • The present invention can be implemented in accordance with numerous aspects consistent with material presented herein. For example, one aspect of the present invention can include a method for manipulating the presentation of an AJAX tree using an array representing the hierarchical path of a tree node. Such a method can begin with the receipt of a user-request to expand a selected tree node of an AJAX tree in a Web page. Next, it can be determined if the tree node is present in the existing path array. When the tree node is present in the existing path array, the existing path array can be modified for the selected tree node. A new path array can be requested from the AJAX engine when the tree node does not exist in the existing path array. A path array handler can be invoked to expand the AJAX tree using the existing path array.
  • Another aspect of the present invention can include a system that enhances the manipulation of an AJAX tree presentation using an array to represent the hierarchical path of a tree node. Such a system can include an AJAX tree, an AJAX engine, and a path array handler. The AJAX engine can be configured to provide a path array for a user-selected tree node of the AJAX tree. The path array can contain data elements that represent the hierarchy of tree nodes for the user-selected node in the AJAX tree. The path array handler can be configured to process the path array to alter the presentation of the AJAX tree.
  • Still another aspect of the present invention can include a Web page that utilizes an array representation of a user-selected tree node to manipulate the presentation of an AJAX tree. Such a Web page can include a path array and a path array handler. The path array can be configured to contain data elements that represent a hierarchical order of tree nodes for a presented AJAX tree. In the path array, the first data element can correspond to the root node of the AJAX tree and the last data element can correspond to the user-selected tree node. The path array handler can be configured to process the data elements of the path array to alter the presentation of the AJAX tree in the Web page.
  • It should be noted that various aspects of the invention can be implemented as a program for controlling computing equipment to implement the functions described herein, or a program for enabling computing equipment to perform processes corresponding to the steps disclosed herein. This program may be provided by storing the program in a magnetic disk, an optical disk, a semiconductor memory, any other recording medium, or can also be provided as a digitally encoded signal conveyed via a carrier wave. The described program can be a single program or can be implemented as multiple subprograms, each of which interact within a single computing device or interact in a distributed fashion across a network space.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • There are shown in the drawings, embodiments which are presently preferred, it being understood, however, that the invention is not limited to the precise arrangements and instrumentalities shown.
  • FIG. 1 is a schematic diagram of a system that utilizes an array to enhance the manipulation of an HTML tree in accordance with embodiments of the inventive arrangements disclosed herein.
  • FIG. 2 is an illustration of depicting the relationship between an HTML tree presentation and a path array in accordance with an embodiment of the inventive arrangements disclosed herein.
  • FIG. 3 is a sample path array handler for using an array representing the hierarchical path of a tree node to manipulate an HTML tree
  • FIG. 4 is a flow chart of a method for using an array representing the hierarchical path of a tree node to manipulate an HTML tree in accordance with an embodiment of the inventive arrangements disclosed herein.
  • DETAILED DESCRIPTION OF THE INVENTION
  • FIG. 1 is a schematic diagram of a system 100 that utilizes an array 150 to enhance the manipulation of an HTML (AJAX) tree 120 in accordance with embodiments of the inventive arrangements disclosed herein. The HTML tree can be a software artifact used in conjunction with a data processing model, which allows tree content to be loaded and updated seamlessly without reloading an entire page. A currently popular HTML tree implementation in this context is an AJAX tree written in JAVA SCRIPT that implements an AJAX data processing model. Throughout the summary, drawings, and detailed description the term “AJAX tree” is used in a generic or implementation agnostic sense to represent any HTML tree that utilizes a hierarchical tree structure of Web content for Web pages. The disclosed invention is not to be construed as limited to AJAX specifics, but can apply to HTML trees implemented in any programming language, whether JAVA based or not.
  • In system 100, a user 105 can select a node of the AJAX tree 120 for expansion. The Web page 115 containing the AJAX tree 120 can request 127 the path array 150 for the selected tree node from a Web server 130 via network 160. A user 105 can access a Web page 115 using client 110. Client 110 can represent a variety of computing devices capable of presenting a Web page 115 and communicating with a Web server 130 over a network 160. The Web page 115 can include an AJAX tree 120 and a path array handler 125.
  • The AJAX tree 120 can be a presentation of tree data 145 in a tree structure within a Web page 115 utilizing the AJAX Web development technique. The user 105 can perform a variety of predefined actions upon the nodes of the AJAX tree 120. When the user 105 elects to expand a node of the AJAX tree 120, the Web page 115 can generate a path array request 127 for the selected node.
  • The request 127 can be conveyed to an associated Web server 130 over a network 160. The Web server 130 can be a computing device configured to handle a variety of requests from Web pages 115. The Web server 130 can include an AJAX engine 135 and a data store 140 containing tree data 145.
  • The AJAX engine 135 can be a software component of the Web server 130 that handles AJAX communications, such as the path array request 127. The AJAX engine 130 can include a path array generator 137. The path array generator 137 can be a software component of the AJAX engine 135 that creates a path array 150 from corresponding tree data 145 for a specific path array request 150. The AJAX tree data 145 can represent the standard data files used to define an AJAX tree 120.
  • In an alternate embodiment, the path array generator 137 can be a component of the Web server 130 that processes the output of the AJAX engine 135 to convert the output into a path array 150.
  • The generated path array 150 can be a data structure configured to define the hierarchical path of the user-selected tree node. The path array 150 can be configured such that the first element of the array 150 corresponds to the root node of the AJAX tree 120 and the last element of the array 150 corresponds to the user-selected tree node. Any elements contained between the first and last elements of the path array 150 can correspond to nodes of the AJAX tree 120 that are hierarchically related to the user-selected node. That is, additional nodes of the AJAX tree 120 that must be expanded in order to expose the user-selected node.
  • It should be noted that the hierarchy expressed within the path array 150 can be searched and manipulated. For example, with this approach, collapsing the last expanded node can be achieved without requesting a new path array 150. In this case, the last element of the path array 150 can be removed and the AJAX tree 120 redrawn using the modified path array 150. Thus, the response and interaction of the AJAX tree 120 is enhanced.
  • When the Web page 115 receives the path array 150, the path array handler 125 can be invoked. The path array handler 125 can represent a software component invoked by the Web page 115 to manipulate the presented AJAX tree 120 according to the contents of the path array 150. The path array handler 125 can process the path array 150 to determine which nodes of the AJAX tree 120 are to be presented in an expanded state.
  • Because the data of the AJAX tree 120 is modified asynchronously to the other contents of the Web page 115, issues can arise when a user 105 uses the navigation controls of the Web page 115. For example, when the user 105 uses the BACK button of the browser, the previously-viewed Web page 115 will be loaded, but the display of the AJAX tree 120 can be reset to its original state, since its state changes independently of the Web page 115.
  • The present invention can be used to address this known issue. The path array 150 can be stored when the loaded Web page 115 changes. The stored path array 150 can be accessed and used to recreate the AJAX tree 120, if needed. The path array 150 can be stored in a cookie (not shown) on the client 110 or within a HyperText Transfer Protocol (HTTP) session variable (not shown) on the Web server 130.
  • As used herein, presented data store, including store 140, can be a physical or virtual storage space configured to store digital information. Data store 140 can be physically implemented within any type of hardware including, but not limited to, a magnetic disk, an optical disk, a semiconductor memory, a digitally encoded plastic memory, a holographic memory, or any other recording medium. The data store 140 can be a stand-alone storage unit as well as a storage unit formed from a plurality of physical devices. Additionally, information can be stored within data store 140 in a variety of manners. For example, information can be stored within a database structure or can be stored within one or more files of a file storage system, where each file may or may not be indexed for information searching purposes. Further, data store 140 can utilize one or more encryption mechanisms to protect stored information from unauthorized access.
  • Network 160 can include any hardware/software/and firmware necessary to convey data encoded within carrier waves. Data can be contained within analog or digital signals and conveyed though data or voice channels. Network 160 can include local components and data pathways necessary for communications to be exchanged among computing device components and between integrated device components and peripheral devices. Network 160 can also include network equipment, such as routers, data lines, hubs, and intermediary servers which together form a data network, such as the Internet. Network 160 can also include circuit-based communication components and mobile communication components, such as telephony switches, modems, cellular communication towers, and the like. Network 160 can include line based and/or wireless communication pathways.
  • FIG. 2 is an illustration 200 of depicting the relationship between an AJAX tree presentation 205 and a path array 215 in accordance with an embodiment of the inventive arrangements disclosed herein. The samples 205 and 215 of the illustration 200 can be utilized by system 100 or any other system that uses an array representation of the hierarchical path of a tree node in an AJAX tree. It should be noted that the samples 205 and 215 shown in illustration 200 are for illustrative purposes only and are not meant as absolute limitations or interpretations of the present invention.
  • In this example, the sample AJAX tree presentation 205 can display data about Company A in an interactive tree structure. For the sake of illustration, a user elects to expand the “Phone” node 210 of the tree. The sample path array 215 can represent the array data structure returned by the AJAX engine containing the hierarchical path for the user-selected tree node.
  • The path array 215 can include an index number 220 and an associated value 225. The index number 220, as with a typical array data structure, can represent an ordering value of the array elements. It should be noted that the array indexing schema is dependent on the programming language used. This example uses a zero-based indexing schema.
  • The value 225 can identify a tree node. The value 225 can be related to an attribute that uniquely identifies the tree node, such as a node ID. In this example, the array element with an index 220 of zero and value 225 of “Root_Node” corresponds to the node in the tree presentation 205 with the label “Company A”, which is the root node of the AJAX tree.
  • The array element with an index 220 of one and value 225 of “IT_Node” corresponds to the node in the tree presentation 205 with the label “IT”. This node is a child node of the root node and the parent node of the selected node 210. The array element with an index 220 of two and value 225 of “Phone_Node” corresponds to the user-selected node 210 in the tree presentation 205 with the label “Phones”.
  • Therefore, the ancestry of the selected node 210 is can be described by the path array 215. Further, the path array 215 can convey which tree nodes need to be expanded in order to reach the selected node 210.
  • FIG. 3 is a sample path array handler 300 for using an array representing the hierarchical path of a tree node to manipulate an AJAX tree in accordance with an embodiment of the inventive arrangements disclosed herein. The sample path array handler 300 can be performed within the context of system 100. It should be noted that the code 305-355 of the sample path array handler 300 is for illustrative purposes only and is not meant as an absolute implementation of the present invention. As such, the sample path array handler 300 in this example uses commands provided in the DOJO framework.
  • The sample path array handler 300 can contain software code 305-355 that can be executed in order to process a received path array, resulting in the alteration of an AJAX tree presentation. Line 305 can contain a declaration of the path array handler 300. In this example, the name of the path array handler 300 is “expandByPath”. The path array handler 300 can require input parameters 307 corresponding to the path array and an index number.
  • In line 310, a local variable can be declared and initialized to contain a copy of the current AJAX tree. Line 315 can determine if the index number parameter is for the root node of the AJAX tree. In line 320, it can be determined if the path array contains a data element at an index number one increment higher than the index number parameter.
  • When a data element exists at this index number, then line 325 can be executed where a deferred variable can be declared and initialized to contain the portion of the AJAX tree expanded at the node identified by the name or value contained within path array at the index value equal to the received parameter 307. In line 330, a recursive call to the path array handler 300 can be made to expand the AJAX tree for the next node in the path array. Therefore, the path array handler 300 can continue to walk through the hierarchy defined by the path array to expand each node in the ancestry of the selected node, including the selected node.
  • It should be noted that any children nodes of the selected node will not be expanded because the selected node is the last element of the path array. This means that a data element cannot exist in the path array beyond the index number of the selected node. Therefore, line 320 will evaluate as FALSE and line 325 cannot execute, which would expand the children nodes of the selected node.
  • When line 320 evaluates as FALSE, line 335 can be executed, which initiates the ELSE clause of the IF-THEN-ELSE control structure. Line 340 can determine if a node of the AJAX tree is selected. In line 345, a variable can be declared and initialized to contain the selected tree node. If the node exists as evaluated in line 350, then line 355 executes where the last element of the path array is reselected in the AJAX tree.
  • The functionality of the path array handler 300 can be illustrated by an example using the illustration 200 of FIG. 2. For illustrative purposes, let us begin with a function call to the path array handler 300 of “expandByPath (path, 0)”, using the sample path array 215 and a starting index 220 of zero.
  • Line 310 executes, creating a copy of the AJAX tree in the variable “_this”. Line 315 evaluates as TRUE, since negative zero times zero is equal to zero. Line 320 also evaluates as TRUE, since a data element exists in the path array 215 with an index 220 of one.
  • Line 325 executes, creating a deferred variable expands the “Root_Node”, index 0, of the AJAX tree. Line 330 executes, calling the path array handler 300 and passing it the path array 215 and an index value of one.
  • Line 310 executes again, creating a copy of the AJAX tree with the “Root_Node” expanded in the variable “_this”. Line 315 evaluates as FALSE, since negative one times one is not equal to zero. Line 320 evaluates as TRUE, since a data element exists in the path array 215 with an index 220 of two.
  • Line 325 executes, creating a deferred variable that expands the “IT_Node”, index one, of the AJAX tree. Now, the AJAX tree has the nodes labeled “Company A” and “IT” expanded. Line 330 executes, calling the path array handler 300 again and passing it the path array 215 and an index value of two.
  • Line 310 executes again, creating a copy of the AJAX tree with both the “Root_Node” and the “IT_Node” expanded in the variable “_this”. Line 315 evaluates as FALSE, since negative two times two is not equal to zero. Line 320 evaluates as FALSE, since a data element does not exist in the path array 215 with an index 220 of three.
  • The ELSE clause executes, starting with line 335. Line 340 evaluates as TRUE, since it was assumed that the user selected this node to expand. Line 345 executes, creating the variable “ts” and initializing it with the tree node corresponding to the selector, which is the “Phone_Node”.
  • Line 350 evaluates as true, since the “Phone_Node” exists. Line 355 executes reselecting the tree node that corresponds to the last element of the path array 215, which is the “Phone_Node”. Therefore, the node of the AJAX tree labeled “Phones” is selected.
  • Each recursive call ends, resulting in an AJAX tree in the variable “_this” that looks like the AJAX tree presentation 205 of FIG. 2. The created tree can then be passed to additional functions for additional processing and presentation within in the Web page.
  • FIG. 4 is a flow chart of a method 400 for using an array representing the hierarchical path of a tree node to manipulate an AJAX tree in accordance with an embodiment of the inventive arrangements disclosed herein.
  • Method 400 can begin with step 405 where a user-request to expand a selected tree node of an AJAX tree can be received. In step 410, it can be determined if the selected tree node is present in the existing path array.
  • If the selected tree node is present in the existing path array, then step 415 can execute where the existing path array can be modified to reflect the selected tree node. From step 415, flow can proceed to step 430.
  • If the tree node is not present in the existing path array, then step 420 can execute where a request can be made to the Web server for a path array for the selected tree node. In step 425, the requested path array can be received from the Web server. The path array handler can be invoked to expand the AJAX tree in step 430.
  • In step 435, it can be determined is a page unload event has occurred. When a page unload event has occurred, step 440 can execute where the path array for the current AJAX tree can be stored. When a page unload event has not occurred, then flow can proceed to either step 405 or 435 where the system waits to receive a new user-request or determine the occurrence of a page unload event.
  • The present invention may be realized in hardware, software, or a combination of hardware and software. The present invention may be realized in a centralized fashion in one computer system, or in a distributed fashion where different elements are spread across several interconnected computer systems. Any kind of computer system or other apparatus adapted for carrying out the methods described herein is suited. A typical combination of hardware and software may be a general purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein.
  • The present invention also may be embedded in a computer program product, which comprises all the features enabling the implementation of the methods described herein, and which when loaded in a computer system is able to carry out these methods. Computer program in the present context means any expression, in any language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: a) conversion to another language, code or notation; b) reproduction in a different material form.
  • This invention may be embodied in other forms without departing from the spirit or essential attributes thereof. Accordingly, reference should be made to the following claims, rather than to the foregoing specification, as indicating the scope of the invention.

Claims (20)

1-20. (canceled)
21. A computer-implemented method for manipulating presentation of an AJAX tree presented within a Web page, comprising:
determining a presence of a user-selected tree node in an existing path array for the AJAX tree;
modifying, based upon the determining, the existing path array to reflect the user-selected tree node; and
invoking a path array handler to expand the AJAX tree, wherein
each tree node of the AJAX tree that is expanded by the path array handler is contained within the existing path array.
22. The method of claim 21, wherein
the modifying includes removing a data element from a last position of the existing path array, and
the removing the data element is repeated until the user-selected tree node is in the last position of the existing path array.
23. The method of claim 21, wherein
the existing path array is stored in a location accessible by the Web page in response to a detection of a page unload event of the Web page.
24. The method of claim 23, wherein
the location is at least one of a Web cookie and a HyperText Transfer Protocol (HTTP) session variable.
25. The method of claim 23, wherein
the page unload event is one of a refresh event, a backward-navigation event, and a forward-navigation event.
26. The method of claim 23, wherein
in response to a detection of a page reload event of the Web page:
the existing pay array is retrieved from the location, and
the path array handler is invoked to present the AJAX tree expanded according to the existing path array.
27. The method of claim 26, wherein
the page reload event is one of a refresh event, a backward-navigation event, and a forward-navigation event.
28. The method of claim 21, wherein
the existing path array contains a plurality of data elements, and
the plurality of data elements represent a hierarchal order of expanded tree nodes contained within the AJAX tree.
29. A computer hardware system configured to manipulate presentation of an AJAX tree presented within a Web page, comprising:
a hardware processor configured to initiate the following operations:
determining a presence of a user-selected tree node in an existing path array for the AJAX tree;
modifying, based upon the determining, the existing path array to reflect the user-selected tree node; and
invoking a path array handler to expand the AJAX tree, wherein
each tree node of the AJAX tree that is expanded by the path array handler is contained within the existing path array.
30. The system of claim 29, wherein
the modifying includes removing a data element from a last position of the existing path array, and
the removing the data element is repeated until the user-selected tree node is in the last position of the existing path array.
31. The system of claim 29, wherein
the existing path array is stored in a location accessible by the Web page in response to a detection of a page unload event of the Web page.
32. The system of claim 31, wherein
the location is at least one of a Web cookie and a HyperText Transfer Protocol (HTTP) session variable.
33. The system of claim 31, wherein
the page unload event is one of a refresh event, a backward-navigation event, and a forward-navigation event.
34. The system of claim 31, wherein
in response to a detection of a page reload event of the Web page:
the existing pay array is retrieved from the location, and
the path array handler is invoked to present the AJAX tree expanded according to the existing path array.
35. The system of claim 34, wherein
the page reload event is one of a refresh event, a backward-navigation event, and a forward-navigation event.
36. The system of claim 29, wherein
the existing path array contains a plurality of data elements, and
the plurality of data elements represent a hierarchal order of expanded tree nodes contained within the AJAX tree.
37. The system of claim 29, wherein the hardware processor is further configured to execute:
requesting, upon the user-selected tree node being absent from the existing path array, a path array for the user-selected tree node from a Web server associated with the Web page.
38. The system of claim 37, wherein
the path array handler is configured to utilize the requested path array to expand the AJAX tree.
39. The system of claim 37, wherein
the requested path array is provided by a path array generator that is a component of an AJAX engine operating on the Web server.
US15/471,879 2008-01-02 2017-03-28 Manipulation of an ajax tree presentation Abandoned US20170206188A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US11/968,278 US9632987B2 (en) 2008-01-02 2008-01-02 Technique that enhances the manipulation of an HTML tree presentation by using an array representation of the hierarchical path of a tree node
US15/471,879 US20170206188A1 (en) 2008-01-02 2017-03-28 Manipulation of an ajax tree presentation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US15/471,879 US20170206188A1 (en) 2008-01-02 2017-03-28 Manipulation of an ajax tree presentation

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US11/968,278 Continuation US9632987B2 (en) 2008-01-02 2008-01-02 Technique that enhances the manipulation of an HTML tree presentation by using an array representation of the hierarchical path of a tree node

Publications (1)

Publication Number Publication Date
US20170206188A1 true US20170206188A1 (en) 2017-07-20

Family

ID=40800244

Family Applications (2)

Application Number Title Priority Date Filing Date
US11/968,278 Active 2033-12-06 US9632987B2 (en) 2008-01-02 2008-01-02 Technique that enhances the manipulation of an HTML tree presentation by using an array representation of the hierarchical path of a tree node
US15/471,879 Abandoned US20170206188A1 (en) 2008-01-02 2017-03-28 Manipulation of an ajax tree presentation

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US11/968,278 Active 2033-12-06 US9632987B2 (en) 2008-01-02 2008-01-02 Technique that enhances the manipulation of an HTML tree presentation by using an array representation of the hierarchical path of a tree node

Country Status (1)

Country Link
US (2) US9632987B2 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107506247A (en) * 2017-08-11 2017-12-22 恒丰银行股份有限公司 A kind of task processing method and equipment based on asynchronism callback
CN107608664A (en) * 2017-09-22 2018-01-19 国云科技股份有限公司 A kind of method that mass data is loaded using zTree

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110161827A1 (en) * 2008-03-05 2011-06-30 Anastasia Dedis Social media communication and contact organization
US20090327928A1 (en) * 2008-03-05 2009-12-31 Anastasia Dedis Method and System Facilitating Two-Way Interactive Communication and Relationship Management
US8448093B2 (en) * 2010-07-23 2013-05-21 Oracle International Corporation Hierarchical organization chart for mobile applications
US9330081B2 (en) 2011-02-04 2016-05-03 Mastercard International Incorporated Computer system and method for generating client-side software demonstrations
US9430548B1 (en) * 2012-09-25 2016-08-30 Emc Corporation Generating context tree data based on a tailored data model
US9112833B2 (en) * 2013-05-01 2015-08-18 Red Hat, Inc. Compression of content paths in a digital certificate
CN103544036A (en) * 2013-10-23 2014-01-29 北京荣之联科技股份有限公司 Page loading method, terminal and system
CN106874387B (en) * 2017-01-11 2020-09-11 中科院微电子研究所昆山分所 Method for displaying real-time information in self-adaptive HTML (Hypertext markup language) scrolling mode

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020042750A1 (en) * 2000-08-11 2002-04-11 Morrison Douglas C. System method and article of manufacture for a visual self calculating order system over the world wide web
US6961909B2 (en) * 2001-01-05 2005-11-01 Hewlett-Packard Development Company, L.P. System for displaying a hierarchical directory
US7188308B2 (en) * 2003-04-08 2007-03-06 Thomas Weise Interface and method for exploring a collection of data
US7242413B2 (en) 2003-05-27 2007-07-10 International Business Machines Corporation Methods, systems and computer program products for controlling tree diagram graphical user interfaces and/or for partially collapsing tree diagrams
US20070192080A1 (en) 2006-01-31 2007-08-16 Carpenter Bryan F Data tree structure for automatic retention of context information
US8965864B2 (en) * 2006-10-31 2015-02-24 Sap Se Method and system for efficient execution and rendering of client/server interactive applications

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107506247A (en) * 2017-08-11 2017-12-22 恒丰银行股份有限公司 A kind of task processing method and equipment based on asynchronism callback
CN107608664A (en) * 2017-09-22 2018-01-19 国云科技股份有限公司 A kind of method that mass data is loaded using zTree

Also Published As

Publication number Publication date
US9632987B2 (en) 2017-04-25
US20090172602A1 (en) 2009-07-02

Similar Documents

Publication Publication Date Title
Eisenman Learning react native: Building native mobile apps with JavaScript
Cantelon et al. Node. js in Action
US10592319B2 (en) API notebook tool
AU2015258733B2 (en) Methods and systems for web content generation
US9239705B2 (en) Method and apparatus for customized software development kit (SDK) generation
US9804837B2 (en) System and method for creating, managing, and reusing schema type definitions in services oriented architecture services, grouped in the form of libraries
Komatineni et al. Pro Android 4
US9703883B2 (en) Social bookmarking of resources exposed in web pages
Hashimi et al. Pro Android 3
US8819012B2 (en) Accessing anchors in voice site content
Grinberg Flask web development: developing web applications with python
US9244709B2 (en) Automatic recognition of web application
Forcier et al. Python web development with Django
JP5099982B2 (en) Method and apparatus for generating an automation-based user interface with complete flexibility
CN100444158C (en) Web page rendering mechanism using external programmatic themes
Galloway et al. Professional ASP. NET MVC 4
US8924845B2 (en) Web application code decoupling and user interaction performance
Holdener Ajax: the definitive guide
CN101373431B (en) Enhanced widget composition platform
US8700988B2 (en) Selectively interpreted portal page layout template
ES2280283T3 (en) Control objects of the server side for the processing of elements of the user interface of the client side.
US6304872B1 (en) Search system for providing fulltext search over web pages of world wide web servers
KR101038896B1 (en) Service program generation technology
US6470349B1 (en) Server-side scripting language and programming tool
US7970944B2 (en) System and method for platform and language-independent development and delivery of page-based content

Legal Events

Date Code Title Description
AS Assignment

Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:CHUSING, TREVETT B.;ZHANG, LEI;ZHU, JIAN;SIGNING DATES FROM 20170315 TO 20170317;REEL/FRAME:041770/0142

STPP Information on status: patent application and granting procedure in general

Free format text: RESPONSE TO NON-FINAL OFFICE ACTION ENTERED AND FORWARDED TO EXAMINER

STCB Information on status: application discontinuation

Free format text: FINAL REJECTION MAILED

STCB Information on status: application discontinuation

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