Sciweavers

205 search results - page 33 / 41
» Optimizing Multiple Top-K Queries over Joins
Sort
View
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 7 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
WWW
2005
ACM
14 years 8 months ago
Executing incoherency bounded continuous queries at web data aggregators
Continuous queries are used to monitor changes to time varying data and to provide results useful for online decision making. Typically a user desires to obtain the value of some ...
Rajeev Gupta, Ashish Puri, Krithi Ramamritham
CIKM
2004
Springer
13 years 11 months ago
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
Jiaheng Lu, Ting Chen, Tok Wang Ling
ICPP
2003
IEEE
14 years 28 days ago
Towards Real-time Parallel Processing of Spatial Queries
Spatial databases are entering an era of mass deployment in various real-life applications, especially mobile and location-based services. The real-time processing of spatial quer...
Haibo Hu, Manli Zhu, Dik Lun Lee
INFOCOM
2006
IEEE
14 years 1 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo