Filters








29,760 Hits in 6.8 sec

Answering bounded continuous search queries in the world wide web

Dirk Kukulenz, Alexandros Ntoulas
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
We present a new optimization method for bounded continuous search queries based on the optimal stopping theory and compare the new method to methods currently applied by Web search systems.  ...  In this paper, we consider the optimization of bounded continuous search queries where only the estimated best k elements are returned to a user.  ...  This is obviously an intrinsic problem if the optimization of bounded continuous search queries is concerned.  ... 
doi:10.1145/1242572.1242647 dblp:conf/www/KukulenzN07 fatcat:2vr4t5is3reulcacjbizukh74u

Automated partitioning design in parallel database systems

Rimma Nehme, Nicolas Bruno
2011 Proceedings of the 2011 international conference on Management of data - SIGMOD '11  
importance of deep integration of the partitioning advisor with the underlying query optimizer.  ...  Our tool recommends which tables should be replicated (i.e., copied into every compute node) and which ones should be distributed according to specific column(s) so that the cost of evaluating similar  ...  For a search strategy, the technique uses a rank-based enumeration search, where partitions are first ranked based on their benefit value, which is approximated as the sum of the differences between the  ... 
doi:10.1145/1989323.1989444 dblp:conf/sigmod/NehmeB11 fatcat:2ah4vpgen5h65brpogj4wttohq

Multi-Criteria Query Optimization in the Presence of Result Size and Quality Tradeoffs

Lakshmi Priya Mahalingam, K. Selçuk Candan
2004 Multimedia tools and applications  
We address the complexity and the well-known NP-complete nature of the query optimization problem by adaptively reducing the granularity of the search space.  ...  For this purpose, unlike the data histograms which capture the data distribution, we propose opt-histograms that capture the distribution of sub-query-plan values over many optimization tasks. select location  ...  Then the paths on the tree (streams) are sorted based on a rank 4 .  ... 
doi:10.1023/b:mtap.0000031755.50716.2a fatcat:gwccha64lzertblwsbvh3q3a4m

Chapter 10: Join Methods and Query Optimization [chapter]

Daniele Braga, Stefano Ceri, Michael Grossniklaus
2010 Lecture Notes in Computer Science  
over services, and includes a branch and bound approach to the exploration of the combinatorial search space of all possible query plans.  ...  Then, this chapter presents an optimization framework for queries over several service interfaces, which considers several cost metrics for mapping queries into query plans, consisting of specific operations  ...  If let run up to exhaustion of the search space, the returned plan is the optimal one, otherwise the returned plan is the one representing the current upper bound, whose "distance" from the optimal one  ... 
doi:10.1007/978-3-642-12310-8_10 fatcat:xsqcjdteyndxpfr4h66sr6g5yq

Feedback based Quality Enhancing Query Suggestion in E- Commerce Environment

2015 International Journal of Science and Research (IJSR)  
Our experiments have shown promising results in using the click-based user feedback to drive success by enhancing the quality of query suggestions.  ...  Our approach is to treat query suggestions as a competition among data resources: we have many query suggestion candidates competing for limited space on the search results page.  ...  For instance, as is the case with search ranking methods, many of the query suggestion approaches are purely document based; that is, they rely on the (indexed) document corpus to produce suggestions.  ... 
doi:10.21275/v4i11.sub158796 fatcat:qtfkdeunfnbzreioifcu67rhxa

Black-Box Complexities of Combinatorial Problems [article]

Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen
2011 arXiv   pre-print
This in particular comes true where the search space does not consist of bit strings and where a reasonable definition of unbiasedness has to be agreed on.  ...  Besides giving interesting bounds for their black-box complexities, our work reveals that the choice of how to model the optimization problem is non-trivial here.  ...  Carola Winzen is a recipient of the Google Europe Fellowship in Randomized Algorithms, and this research is supported in part by this Google Fellowship.  ... 
arXiv:1108.0342v1 fatcat:ngovteeumjhijamawb5d3bxfsq

Supporting ranking queries on uncertain and incomplete data

Mohamed A. Soliman, Ihab F. Ilyas, Shalev Ben-David
2010 The VLDB journal  
In this paper, we present a new probabilistic model, based on partial orders, to encapsulate the space of possible rankings originating from score uncertainty.  ...  In addition, we design sampling techniques based on Markov chains to compute approximate query answers. Our experimental evaluation uses both real and synthetic data.  ...  We give branch-and-bound search algorithms to compute exact query answers based on A * search.  ... 
doi:10.1007/s00778-009-0176-8 fatcat:h7y2pen3hjhtbjl6cslw62i4e4

Selective Search

Anagha Kulkarni, Jamie Callan
2015 ACM Transactions on Information Systems  
An oracle experiment that uses optimal shard ranking for a query indicates that selective search can outperform exhaustive search's effectiveness.  ...  This search technique first partitions the corpus, based on documents' similarity, into topic-based shards.  ...  SELECTIVE SEARCH WITH RELEVANCE-BASED RANKING EFFECTS OF QUERY OPTIMIZATION Dynamic index pruning approaches, commonly referred to as query optimization techniques, are routinely employed by search systems  ... 
doi:10.1145/2738035 fatcat:fistpgm5abemdeecnpiqmt4szi

Learning to Rank and Discover for E-Commerce Search [chapter]

Anjan Goswami, Chengxiang Zhai, Prasant Mohapatra
2018 Lecture Notes in Computer Science  
We further propose novel algorithms based on eLTR to improve the traditional LTR used in the current E-Com search engines by "forcing" exploration of a fixed number of items while limiting the relevance  ...  One of the primary challenges constitutes optimizing it for relevance and revenue and simultaneously maintaining a discovery strategy.  ...  Authors conducted their experiments showing optimization of two different variants of normalized discounted cumulative gain (NDCG) [8] metrics that are based on judgments of human raters and based on  ... 
doi:10.1007/978-3-319-96133-0_25 fatcat:5vekxxsuzjdarith4ufv2c52ni

Efficient and effective similarity search over probabilistic data based on Earth Mover's Distance

Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu
2011 The VLDB journal  
We present a new database approach to answer range queries and k-nearest neighbor queries on probabilistic data, on the basis of Earth Mover's Distance.  ...  While similarity search is an important functionality supporting the manipulation of probabilistic data, it raises new challenges to traditional relational database.  ...  Second, the k-nearest neighbor is based on the distance to the querying distribution, which cannot be formulated with a simple ranking scheme as top-k query does.  ... 
doi:10.1007/s00778-011-0258-2 fatcat:xxhk3dqz2fewjbpnyhtjetyf4i

Efficient and effective similarity search over probabilistic data based on earth mover's distance

Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu
2010 Proceedings of the VLDB Endowment  
We present a new database approach to answer range queries and k-nearest neighbor queries on probabilistic data, on the basis of Earth Mover's Distance.  ...  While similarity search is an important functionality supporting the manipulation of probabilistic data, it raises new challenges to traditional relational database.  ...  Second, the k-nearest neighbor is based on the distance to the querying distribution, which cannot be formulated with a simple ranking scheme as top-k query does.  ... 
doi:10.14778/1920841.1920938 fatcat:u43rgxsmyrawbcgf4r2bhcy5xi

ICDE conference 2015 detailed author index

2015 2015 IEEE 31st International Conference on Data Engineering  
Liu, Jiajun 423 Interactive Top-k Spatial Keyword Queries 987 Bounded Quadrant System: Error-Bounded Trajectory Compression on the Go L continues on next page… [Search] A B C D E F G H I  ...  Framework for Top-k and Threshold-Based String Similarity Search de Oliveira, Pericles 399 Ranking Candidate Networks of Relations to Improve Keyword Search over Relational Databases de Oliveira  ... 
doi:10.1109/icde.2015.7113260 fatcat:ep7pomkm55f45j33tkpoc5asim

The PGM-index: a multicriteria, compressed and learned approach to data indexing [article]

Paolo Ferragina, Giorgio Vinciguerra
2019 arXiv   pre-print
However, these novel approaches are based on heuristics, thus they lack any guarantees both in their time and space requirements.  ...  Second, we design a PGM-index that adapts itself to the distribution of the queries, thus resulting in the first known distribution-aware learned index to date.  ...  For the rank, membership and predecessor queries, the bounds on the running time and the I/O complexity follow easily by observing that a query performs L binary searches over intervals having size at  ... 
arXiv:1910.06169v1 fatcat:yf2kl52o5jfpnenauikl52wg7u

Location-aware type ahead search on spatial databases

Senjuti Basu Roy, Kaushik Chakrabarti
2011 Proceedings of the 2011 international conference on Management of data - SIGMOD '11  
of the query string typed so far, and which rank highest in terms of proximity to the user's location and other static scores.  ...  We propose a formal model for query processing cost and develop novel techniques that optimize that cost.  ...  the scores of the objects in that subtree, and finally return the top k objects based on the ranking function.  ... 
doi:10.1145/1989323.1989362 dblp:conf/sigmod/RoyC11 fatcat:oob6t5ehgzbxdclu6ftww5d3k4

Rank-energy selective query forwarding for distributed search systems

Amin Teymorian, Ophir Frieder, Marcus A. Maloof
2013 Proceedings of the 22nd ACM international conference on Conference on information & knowledge management - CIKM '13  
Selectively forwarding queries between geographically distributed search sites may help.  ...  Nevertheless, electricity costs remain substantial sources of operating expenses. We present a hybrid rank-energy query forwarding model termed "RESQ."  ...  ACKNOWLEDGMENTS The authors thank Xiao Qin of Worcester Polytechnic Institute for early design discussions, and the three anonymous reviewers for detailed comments and helpful suggestions.  ... 
doi:10.1145/2505515.2505710 dblp:conf/cikm/TeymorianFM13 fatcat:nfqchcwp3zhf5ad3bmmczl4ciq
« Previous Showing results 1 — 15 out of 29,760 results