Sciweavers

90 search results - page 3 / 18
» Efficient Evaluation of Queries with Mining Predicates
Sort
View
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 6 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
ADC
2007
Springer
193views Database» more  ADC 2007»
13 years 12 months ago
Optimizing XPath Queries on Streaming XML Data
XML stream processing has recently become popular for many applications such as selective dissemination of information. Several approaches have been proposed and most of them are ...
Keerati Jittrawong, Raymond K. Wong
GEOINFORMATICA
2008
123views more  GEOINFORMATICA 2008»
13 years 5 months ago
Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects
Topological relationships like overlap, inside, meet, and disjoint uniquely characterize the relative position between objects in space. For a long time, they have been a focus of...
Reasey Praing, Markus Schneider
KDD
2002
ACM
150views Data Mining» more  KDD 2002»
14 years 6 months ago
Querying multiple sets of discovered rules
Rule mining is an important data mining task that has been applied to numerous real-world applications. Often a rule mining system generates a large number of rules and only a sma...
Alexander Tuzhilin, Bing Liu
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
14 years 7 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng