Article

Discovery of Influence Sets in Frequently Updated Databases

Authors:

Ioana Stanoi,

Mirek Riedewald,

Divyakant Agrawal,

Amr El AbbadiAuthors Info & Claims

VLDB '01: Proceedings of the 27th International Conference on Very Large Data Bases

Pages 99 - 108

Published: 11 September 2001 Publication History

Get Access

Abstract

No abstract available.

References

[1]

{BBK00} C. Bohm, B. Braunmuller, and H. P. Kriegel. The pruning power: theory and heuristics for mining databases with multiple k-nearest neighbor queries. In Proceedings of the International Conference on Data Warehousing and Knowledge Discovery (DAWAK), 2000.

Crossref

Google Scholar

[2]

{BBK⁺01} S. Berchtold, C. Bohm, D. A. Keim, F. Krebs, and H. P. Kriegel. On optimizing nearest neighbor queries in high-dimensional data spaces. In Proceedings of 8th International Conference on Database Theory (ICDT), 2001.

Digital Library

Google Scholar

[3]

{BBKK97} S. Berchtold, C. Bohm, D. A. Keim, and H. P. Kriegel. A cost model for nearest neighbor search in high-dimensional data space. In Proceedings of the ACM PODS Conference, 1997.

Digital Library

Google Scholar

[4]

{BEKS00} B. Braunmuller, M. Ester, H. P. Kriegel, and J. Sander. Efficiently supporting multiple similarity queries for mining in metric databases. In Proceedings of the 16th International Conference on Data Engineering (ICDE), 2000.

Digital Library

Google Scholar

[5]

{BKKS98} S. Berchtold, D. A. Keim, H. P. Kriegel, and T. Seidl. Fast nearest neighbor seearch in high-dimensional data space. In Proceedings of 14th International Conference on Data Engineering (ICDE), 1998.

Digital Library

Google Scholar

[6]

{BKOS00} M. De Berg, M. Van Kreveld, M. Overmars, and O. Schwarzkopf. Computational geometry: Algorithms and applications. In Springer-Verlag, 2000.

Digital Library

Google Scholar

[7]

{HS95} G.R. Hjaltason and H. Samet. Ranking in spatial databases. In Proceedings of the 4th International Symposium on Large Spatial Databases, 1995.

Digital Library

Google Scholar

[8]

{KM00} F. Korn and S. Muthukrishnan. Influence sets based on reverse nearest neighbor queries. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 2000.

Digital Library

Google Scholar

[9]

{SAA00} I. Stanoi, D. Agrawal, and A. El Abbadi. Reverse nearest neighbor queries for dynamic databases. In Proceedings of the ACM SIGMOD Workshop on Data Mining and Knowledge Discovery (DMKD), 2000.

Google Scholar

[10]

{Tha00} John Thackara. Doors of perception. In www.doorsofperception.com and CHI2000, April 2000.

Google Scholar

[11]

{WJ96} D.A. White and R. Jain. Similarity indexing: algorithms and performance. In Proceedings of Storage and Retrieval for Image and Video Databases (SPIE), 1996.

Crossref

Google Scholar

Cited By

View all

Zhang JHarn PKu WSun MQin XLu HJiang X(2019)An overlapping Voronoi diagram-based system for multi-criteria optimal location queriesGeoinformatica10.1007/s10707-018-00338-723:1(105-161)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s10707-018-00338-7
Yang SCheema MLin XZhang YZhang W(2017)Reverse k nearest neighbors queries and spatial reverse top-k queriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-016-0445-226:2(151-176)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s00778-016-0445-2
Fort MSellarès J(2016)Efficient multiple bichromatic mutual nearest neighbor query processingInformation Systems10.1016/j.is.2016.07.00362:C(136-154)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1016/j.is.2016.07.003
Show More Cited By

Recommendations

Mining of closed frequent subtrees from frequently updated databases

We study the problem of mining closed frequent subtrees from tree databases that are updated regularly over time. Closed frequent subtrees provide condensed and complete information for all frequent subtrees in the database. Although mining closed ...
A decremental algorithm of frequent itemset maintenance for mining updated databases

Data-mining and machine learning must confront the problem of pattern maintenance because data update is a fundamental operation in data management. Most existing data-mining algorithms assume that the database is static, and a database update requires ...
Knowledge Discovery in Multiple Databases

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

VLDB '01: Proceedings of the 27th International Conference on Very Large Data Bases

September 2001

709 pages

ISBN:1558608044

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 11 September 2001

Qualifiers

Article

Conference

VLDB01

VLDB01: 27th International Conference on Very Large Data Bases

September 11 - 14, 2001

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

47
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhang JHarn PKu WSun MQin XLu HJiang X(2019)An overlapping Voronoi diagram-based system for multi-criteria optimal location queriesGeoinformatica10.1007/s10707-018-00338-723:1(105-161)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s10707-018-00338-7
Yang SCheema MLin XZhang YZhang W(2017)Reverse k nearest neighbors queries and spatial reverse top-k queriesThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-016-0445-226:2(151-176)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s00778-016-0445-2
Fort MSellarès J(2016)Efficient multiple bichromatic mutual nearest neighbor query processingInformation Systems10.1016/j.is.2016.07.00362:C(136-154)Online publication date: 1-Dec-2016
https://dl.acm.org/doi/10.1016/j.is.2016.07.003
Yang SCheema MLin XWang W(2015)Reverse k nearest neighbors query processingProceedings of the VLDB Endowment10.14778/2735479.27354928:5(605-616)Online publication date: 1-Jan-2015
https://dl.acm.org/doi/10.14778/2735479.2735492
Lu YCong GLu JShahabi CAli MHuang YGertz MRenz MSankaranarayanan J(2015)Efficient algorithms for answering reverse spatial-keyword nearest neighbor queriesProceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems10.1145/2820783.2820873(1-4)Online publication date: 3-Nov-2015
https://dl.acm.org/doi/10.1145/2820783.2820873
Chen JHuang JWen ZHe ZTaylor KZhang R(2015)Analysis and evaluation of the top-$$k$$k most influential location selection queryKnowledge and Information Systems10.1007/s10115-013-0720-043:1(181-217)Online publication date: 1-Apr-2015
https://dl.acm.org/doi/10.1007/s10115-013-0720-0
Zhang ZJin CKang Q(2014)Reverse k-ranks queryProceedings of the VLDB Endowment10.14778/2732951.27329527:10(785-796)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.14778/2732951.2732952
Borutta FNascimento MNiedermayer JKröger P(2014)Monochromatic RkNN queries in time-dependent road networksProceedings of the Third ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems10.1145/2675316.2675317(26-33)Online publication date: 4-Nov-2014
https://dl.acm.org/doi/10.1145/2675316.2675317
Lu YLu JCong GWu WShahabi C(2014)Efficient Algorithms and Cost Models for Reverse Spatial-Keyword k-Nearest Neighbor SearchACM Transactions on Database Systems10.1145/257623239:2(1-46)Online publication date: 26-May-2014
https://dl.acm.org/doi/10.1145/2576232
Qi JZhang RWang YXue AYu GKulik L(2014)The min-dist location selection and facility replacement queriesWorld Wide Web10.1007/s11280-013-0223-717:6(1261-1293)Online publication date: 1-Nov-2014
https://dl.acm.org/doi/10.1007/s11280-013-0223-7
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Mining of closed frequent subtrees from frequently updated databases

A decremental algorithm of frequent itemset maintenance for mining updated databases

Knowledge Discovery in Multiple Databases

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations