7536396

Query-Aware Sampling of Data Streams

PublishedMay 19, 2009
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
18 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A method of assigning sampling methods to each input stream for arbitrary query sets in a data stream management system, tile method comprising: splitting all query nodes in a query directed acyclic graph (DAG) having multiple parent nodes into sets of independent nodes having a single parent; computing via a processor a grouping set for every node in each set of independent nodes; reconciling each parent node with each child node in each set of independent nodes; reconciling between multiple child nodes that share a parent node; and generating a final grouping set based on the reconciliation between the multiple child nodes that share the parent node for at least one node describing how to sample an input stream for the at least one node.

2

2. The method of claim 1 , further comprising labeling sampling unsafe nodes.

3

3. The method of claim 1 , wherein the final grouping set comprises a labeling of each leaf node with a compatible sampling method.

4

4. The method of claim 1 , wherein computing a grouping set for every node is performed using a single node grouping set analysis.

5

5. The method of claim 1 , wherein the final grouping set for the at least one node further describes what records should be dropped by the data stream management system.

6

6. The method of claim 5 , wherein the data stream management system implements the sampling associated with the final grouping set for at least one node based on a threshold associated with flow of data stream records.

7

7. A system for assigning sampling methods to each input stream for arbitrary query sets in a data stream management system, tile system comprising: a processor; a module configured to control the processor to split all query nodes in a query directed acyclic graph (DAG) having multiple parent nodes into sets of independent nodes having a single parent; a module configured to control the processor to compute a grouping set for every node in each set of independent nodes: a module configured to control the processor to reconcile each parent node with each child node in each set of independent nodes; a module configured to control the processor to reconcile between multiple child nodes that share a parent node; and a module configured to control the processor to generate a final grouping set based on the reconciliation between the multiple child nodes that share the parent node for at least one node describing how to sample an input stream for the at least one node.

8

8. The system of claim 7 , further comprising a module configured to control the processor to label sampling unsafe nodes.

9

9. The system of claim 7 , wherein the final grouping set comprises a labeling of each leaf node with a compatible sampling method.

10

10. The system of claim 7 , wherein the module configured to control the processor to compute a grouping set for every node further computes the grouping set using a single node grouping set analysis.

11

11. The system of claim 7 , wherein the final grouping set for the at least one node further describes what records should be dropped by the data stream management system.

12

12. The system of claim 11 , wherein the data stream management system implements the sampling associated with the final grouping set for at least one node based on a threshold associated with flow of data stream records.

13

13. A computer readable storage medium storing instructions for controlling a computing device to assign sampling methods to each input stream for arbitrary query sets in a data stream management system, the instructions comprising: splitting all query nodes in a query directed acyclic graph (DAG) having multiple parent nodes into sets of independent nodes having a single parent; computing a grouping set for every node in each set of independent nodes; reconciling each parent node with each child node in each set of independent nodes; reconciling between multiple child nodes that share a parent node; and generating a final grouping set based on the reconciliation between the multiple child nodes that share the parent node for at least one node describing how to sample an input stream for the at least one node.

14

14. The computer readable storage medium of claim 13 , the instructions further comprising labeling sampling unsafe nodes.

15

15. The computer readable storage medium of claim 13 , wherein the final grouping set comprises a labeling of each leaf node with a compatible sampling method.

16

16. The computer readable storage medium of claim 13 , wherein computing a grouping set for every node is performed using a single node grouping set analysis.

17

17. The computer readable storage medium of claim 13 , wherein the final grouping set for the at least one node further describes what records should be dropped by the data stream management system.

18

18. The computer readable storage medium of claim 17 , wherein the data stream management system implements the sampling associated with the final grouping set for at least one node based on a threshold associated with flow of data stream records.

Patent Metadata

Filing Date

Unknown

Publication Date

May 19, 2009

Inventors

Theodore JOHNSON
Shanmugavelayutham Muthukrishnan
Oliver Spatscheck
Vladislav Shkapenyuk

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “QUERY-AWARE SAMPLING OF DATA STREAMS” (7536396). https://patentable.app/patents/7536396

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.