Sequential dependencies

Proceedings of the VLDB Endowment

Volumn 2, Issue 1, 2009, Pages 574-585

  Golab, Lukasz ^a   Karloff, Howard ^a   Korn, Flip ^a   Saha, Avishek ^b   Srivastava, Divesh ^a  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF UTAH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ATTRIBUTE VALUES; COMPACT REPRESENTATION; ORDERED DOMAINS; OUT OF ORDER; QUALITY PROBLEMS; REAL-WORLD; SEQUENCE NUMBER; SEQUENTIAL DEPENDENCIES;

SEMANTICS;

EID: 80052369619     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1687627.1687693     Document Type: Article

References (25)

1. R. Agrawal and R. Srikant. Mining sequential patterns. ICDE 1995, 3-14.
2. M. Albert et al. Longest increasing subsequences in sliding windows. Theor. Comput. Sci., 321(2-3):405-414, 2004.
3. S. Babu, U. Srivastava, and J. Widom. Exploiting k-constraints to reduce memory overhead in continuous queries over data streams. ACM Trans. Database Syst., 29(3):545-580, 2004.
4. P. Bohannon, W. Fan, F. Geerts, X. Jia, and A. Kementsietsidis. Conditional functional dependencies for data cleaning. ICDE 2007, 746-755.
5. L. Bravo, W. Fan, and S. Ma. Extending dependencies with conditions. VLDB 2007, 243-254.
6. E. Chen, H. Yuan, and L. Yang. Longest increasing subsequences in windows based on canonical antichain partition. Theor. Comput. Sci. 378(3):223-236, 2007.
7. F. Chiang and R. Miller. Discovering data quality rules. PVLDB, 1(1):1166-1177, 2008.
8. J. Dong and R. Hull. Applying approximate order dependency to reduce indexing space. SIGMOD 1982, 119-127.
9. W. Fan, F. Geerts, L.V.S. Lakshmanan, and M. Xiong. Discovering conditional functional dependencies. ICDE 2009, to appear.
10. M. Fredman. On computing the length of longest increasing subsequences. Discrete Math., 11:29-35, 1975.
11. S. Ginsburg and R. Hull. Order dependency in the relational model. Theor. Comput. Sci., 26:149-195, 1983.
12. S. Ginsburg and R. Hull. Sort sets in the relational model. PODS 1983, 332-339.
13. L. Golab, H. Karloff, F. Korn, D. Srivastava, and B. Yu. On generating near-optimal tableaux for conditional functional dependencies. PVLDB, 1(1):376-390, 2008.
14. P. Gopalan, T. Jayram, R. Krauthgamer, and R. Kumar. Estimating the sortedness of a data stream. SODA 2007, 318-327.
15. S. Guo, W. Sun, and M. Weiss. Solving satisfiability and implication problems in database systems. ACM Trans. Database Syst., 21(2):270-293, 1996.
16. A. Gupta and F. Zane. Counting inversions in lists. SODA 2003, pages 253-254.
17. Y. Huhtala, J. Karkkainen, P. Porkka, and H. Toivonen. Tane: An efficient algorithm for discovering functional and approximate dependencies. The Computer Journal, 42(2):100-111, 1999.
18. M. Kearns. The Computational complexity of machine learning. MIT Press, 1989.
19. J. Kivinen and H. Mannila. Approximate inference of functional dependencies from relations. Theor. Comput. Sci., 149(1):129-149, 1995.
20. F. Korn, S. Muthukrishnan, and Y. Zhu. Checks and balances: monitoring data quality problems in network traffic databases. VLDB 2003, 536-547.
21. H. Mannila, H. Toivonen, and A. Verkamo. Discovery of frequent episodes in event sequences. Data Min. Knowl. Discov., 1(3):259-289, 1997.
22. S. Papadimitriou, J. Sun, and C. Faloutsos. Streaming pattern discovery in multiple time-series. VLDB 2005, 697-708.
23. M. Stonebraker and U. Cetintemel. "one size fits all": An idea whose time has come and gone. ICDE 2005, 2-11.
24. J. Wijsen. Temporal dependencies with order constraints. Technical report, TimeCenter TR-47, 1999.
25. Y. Zhu and D. Shasha. Statstream: Statistical monitoring of thousands of data streams in real time. VLDB 2002, 358-369