Sciweavers

69 search results - page 9 / 14
» Query Planning for Searching Inter-dependent Deep-Web Databa...
Sort
View
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
15 years 10 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
SIGMOD
2010
ACM
210views Database» more  SIGMOD 2010»
14 years 9 months ago
Searching trajectories by locations: an efficiency study
Trajectory search has long been an attractive and challenging topic which blooms various interesting applications in spatial-temporal databases. In this work, we study a new probl...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Yu Zhen...
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
15 years 4 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
VLDB
1995
ACM
129views Database» more  VLDB 1995»
15 years 1 months ago
A Cost Model for Clustered Object-Oriented Databases
Query processing is one of the most, critical issues in Object-Oriented DBMSs. Extensible opt,imizers with efficient, search strategies require a cost model to select the most eff...
Georges Gardarin, Jean-Robert Gruser, Zhao-Hui Tan...
91
Voted
BMCBI
2007
134views more  BMCBI 2007»
14 years 9 months ago
PLAN: a web platform for automating high-throughput BLAST searches and for managing and mining results
Background: BLAST searches are widely used for sequence alignment. The search results are commonly adopted for various functional and comparative genomics tasks such as annotating...
Ji He, Xinbin Dai, Xuechun Zhao