Sciweavers

2135 search results - page 291 / 427
» Database Paper - The IRI Marketing Data Set
Sort
View
SIGMOD
2005
ACM
254views Database» more  SIGMOD 2005»
16 years 6 months ago
Conceptual Partitioning: An Efficient Method for Continuous Nearest Neighbor Monitoring
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...
Kyriakos Mouratidis, Marios Hadjieleftheriou, Dimi...
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
16 years 6 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...
DASFAA
2005
IEEE
171views Database» more  DASFAA 2005»
15 years 11 months ago
Mining Succinct Systems of Minimal Generators of Formal Concepts
Formal concept analysis has become an active field of study for data analysis and knowledge discovery. A formal concept C is determined by its extent (the set of objects that fall...
Guozhu Dong, Chunyu Jiang, Jian Pei, Jinyan Li, Li...
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
16 years 7 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
16 years 23 days ago
Recommending Join Queries via Query Log Analysis
— Complex ad hoc join queries over enterprise databases are commonly used by business data analysts to understand and analyze a variety of enterprise-wide processes. However, eff...
Xiaoyan Yang, Cecilia M. Procopiuc, Divesh Srivast...