Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Exploiting query views for static index pruning in web search engines
Download
index.pdf
Date
2009-12-01
Author
Altıngövde, İsmail Sengör
Ulusoy, Özgür
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
142
views
0
downloads
Cite This
We propose incorporating query views in a number of static pruning strategies, namely term-centric, document-centric and access-based approaches. These query-view based strategies considerably outperform their counterparts for both disjunctive and conjunctive query processing in Web search engines.
URI
https://hdl.handle.net/11511/43176
DOI
https://doi.org/10.1145/1645953.1646273
Collections
Department of Computer Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Alternative Plan Generation methods for Multiple Query Optimization
Menekse, G; Polat, Faruk; Cosar, A (1998-10-28)
Alternative Plan Generation (APG) is an important phase of Multiple Query Optimization (MQO) in relational databases. It is necessary to generate a number of alternative plans in such a way that the sharing between queries is maximized and an optimal execution plan with minimal cost is obtained. For relational databases several methods have previously been proposed for generating alternative plans using commutativity and associativity properties of select, project and join operations. When all possible alte...
Semantic information-based alternative plan generation for multiple query optimization
Polat, Faruk; Alhajj, R (Elsevier BV, 2001-09-01)
This paper addresses the impact of semantic information about queries on alternative plan generation (APG) for multiple query optimization (MQO). MQO covers optimizing the execution of a set of queries together where each query in the set to be optimized has several alternative execution plans. A multiple query optimizer selects an alternative plan for each query to obtain an optimal global execution plan. Our approach uses information such as common relations, common possible joins and common conditions to...
Non-Maxwellian locally-conformal PML absorbers for finite element mesh truncation
Ozgun, Ozlem; Kuzuoğlu, Mustafa (Institute of Electrical and Electronics Engineers (IEEE), 2007-03-01)
We introduce the locally-conformal perfectly matched layer (PML) approach, which is an easy and straightforward PML implementation, to the problem of mesh truncation in the finite element method (FEM). This method is based on a locally-defined complex coordinate transformation which has no explicit dependence on the differential geometric characteristics of the PML-free space interface. As a result, it is possible to handle challenging PML geometries with interfaces having arbitrary curvature, especially th...
Serializability of nested transactions in multidatabases
Halıcı, Uğur; Dogac, A (1997-01-01)
The correctness of nested transactions for multidatabases differs from that of flat transactions in that, for nested transactions the execution order of siblings at each related site should also be consistent. In this paper we first propose a simple but powerful theory for the serializability of nested transactions in multidatabases and then a technique called Nested Tickets Method for Nested transactions (NTNT). The NTNT technique provides correctness of nested transactions in multidatabases without violat...
Integer Linear Programming Solution for the Multiple Query Optimization Problem
Dokeroglu, Tansel; Bayir, Murat Ali; Coşar, Ahmet (2014-10-28)
Multiple Query Optimization (MQO) is a technique for processing a batch of queries in such a way that shared tasks in these queries are executed only once, resulting in significant savings in the total evaluation. The first phase of MQO requires producing alternative query execution plans so that the shared tasks between queries are identified and maximized. The second phase of MQO is an optimization problem where the goal is selecting exactly one of the alternative plans for each query to minimize the tota...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
İ. S. Altıngövde and Ö. Ulusoy, “Exploiting query views for static index pruning in web search engines,” 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/43176.