Legal claims defining the scope of protection, as filed with the USPTO.
1. A computerized method of updating a multimedia content description represented as a tree comprising: receiving, by a decoder, a fragment update unit for the multimedia content description, the fragment update unit comprising a navigation path, a fragment payload, and an update command, wherein the navigation path is a context-based address that selects a set of nodes based on their content; selecting a set of nodes in the tree using the navigation path; selecting the update command; formatting the fragment payload if required by the update command; calculating the navigation path; creating the fragment update unit from the navigation path, the update command, and the fragment payload if required; and applying the update command to the selected set of nodes, wherein formatting the fragment payload comprises including an attribute identification tag when an attribute is to be updated and wherein the fragment payload is not required when a fragment is to be deleted.
2. The computerized method of claim 1 , wherein the content-based address is expressed as an XML XPath location path when the multimedia content description is coded in XML (extensible markup language).
3. The computerized method of claim 1 , wherein the fragment update unit comprises a fragment payload and applying the update command comprises updating the set of nodes in the tree with the fragment payload.
4. The computerized method of claim 3 , wherein the fragment update unit further comprises a plurality of fragment payloads and updating the set of nodes comprises updating each one of the set of nodes with a different one of the plurality of fragment payloads in a predetermined order.
5. The computerized method of claim 4 , wherein the predetermined order is determined by an ordering of all nodes in the tree.
6. The computerized method of claim 5 , wherein the ordering of all nodes in the tree is selected from the group consisting of pre-order, post-order and infix order.
7. The computerized method of claim 3 , wherein the fragment payload is selected from the group consisting of a fragment, a fragment reference, and an attribute.
8. The computerized method of claim 1 , wherein the update command is selected from the group consisting of add, delete, and replace commands.
9. The computerized method of claim 1 further comprising: sending the fragment update unit as pan of an access unit.
10. A computer-readable storage medium having executable instructions to cause a computer to execute a method comprising: receiving a fragment update unit for a multimedia content description represented as a tree, the fragment update unit comprising a navigation path, a fragment payload, and an update command, wherein the navigation path is a context-based address that selects a set of nodes based on their content; selecting a set of nodes in the tree using the navigation path; selecting the update command; formatting the fragment payload if required by the update command; calculating the navigation path; creating the fragment update unit from the navigation path, the update command, and the fragment payload if required; and applying the update command to the selected set of nodes, wherein formatting the fragment payload comprises including an attribute identification tag when an attribute is to be updated and wherein the fragment payload is not required when a fragment is to be deleted.
11. The computer-readable storage medium of claim 10 , wherein the content-based address is expressed as an XML XPath location path when the multimedia content description is coded in XML (extensible markup language).
12. The computer-readable storage medium of claim 10 , wherein the fragment update unit comprises a fragment payload and applying the update command comprises updating the set of nodes in the tree with the fragment payload.
13. The computer-readable storage medium of claim 12 , wherein the fragment update unit further comprises a plurality of fragment payloads and updating the set of nodes comprises updating each one of the set of nodes with a different one of the plurality of fragment payloads in a predetermined order.
14. The computer-readable storage medium of claim 13 , wherein the predetermined order is determined by an ordering of all nodes in the tree.
15. The computer-readable storage medium of claim 14 , wherein the ordering of all nodes in the tree is selected from the group consisting of pre-order, post-order and infix order.
16. The computer-readable storage medium of claim 12 , wherein the fragment payload is selected from the group consisting of a fragment, a fragment reference, and an attribute.
17. The computer-readable storage medium of claim 10 , wherein the update command is selected from the group consisting of add, delete, and replace commands.
18. The computer-readable storage medium of claim 10 , wherein the method further comprises: sending the fragment update unit as pan of an access unit.
19. A system for updating a multimedia content description represented as a tree comprising: a processor coupled to a bus; a memory coupled to the processor though the bus; a communications interface coupled to the processor though the bus, and further coupled to a communications medium; and a decode process executed by the processor from the memory to cause the processor to: receive, though the communications interface, a fragment update unit for the multimedia content description, wherein the fragment update unit comprises a navigation path, a fragment payload, and an update command, wherein the navigation path is a context-based address that selects a set of nodes based on their content; select a set of nodes in the tree using the navigation path, select the update command; format the fragment payload if required by the update command; calculate the navigation path; create the fragment update unit from the navigation path, the update command, and the fragment payload if required; and apply the update command to the selected set of nodes, wherein formatting the fragment payload comprises including an attribute identification tag when an attribute is to be updated and wherein the fragment payload is not required when a fragment is to be deleted.
20. The system of claim 19 , wherein the fragment update unit comprises a fragment payload and the decode process further causes the processor to update the set of nodes in the tree with the fragment payload when applying the update command.
21. The system of claim 20 , wherein the fragment update unit further comprises a plurality of fragment payloads and the decode process further causes the processor to update each one of the set of nodes with a different one of the plurality of fragment payloads in a predetermined order to update the set of nodes.
22. The system of claim 20 , wherein the fragment payload is selected from the group consisting of a fragment, a fragment reference, and an attribute.
23. The system of claim 19 , wherein the update command is selected from the group consisting of add, delete, and replace commands.
Unknown
March 30, 2010
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.