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
On the size of full element-indexes for XML keyword search
Download
index.pdf
Date
2012-04-27
Author
Atilgan, Duygu
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
192
views
0
downloads
Cite This
We show that a full element-index can be as space-efficient as a direct index with Dewey ids, after compression using typical techniques
Subject Keywords
Space complexity
,
Query processing
,
Conjunctive query
,
Direct index
,
Ancestor node
URI
https://hdl.handle.net/11511/34486
DOI
https://doi.org/10.1007/978-3-642-28997-2_63
Collections
Department of Computer Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Using object-oriented materialized views to answer selection-based complex queries
Alhajj, R; Polat, Faruk (1999-09-01)
Presented in this paper is a model that utilizes existing materialized views to handle a wide range of complex selection-based queries, including linear recursive queries. Such queries are complex because it is almost impossible for naive users to predict the formulation of their predicate expressions. Object variables bound to objects in the result of a query are allowed to appear in the predicate of that query. Also, the predicate definition is extended to make it possible to have in the output only a sub...
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...
On endomorphisms of surface mapping class groups
Korkmaz, Mustafa (Elsevier BV, 2001-05-01)
In this paper, we prove that every endomorphism of the mapping class group of an orientable surface onto a subgroup of finite index is in fact an automorphism.
Static index pruning in web search engines
Altıngövde, İsmail Sengör; Ulusoy, Özgür (Association for Computing Machinery (ACM), 2012-2-1)
Static index pruning techniques permanently remove a presumably redundant part of an inverted file, to reduce the file size and query processing time. These techniques differ in deciding which parts of an index can be removed safely; that is, without changing the top-ranked query results. As defined in the literature, the query view of a document is the set of query terms that access to this particular document, that is, retrieves this document among its top results. In this paper, we first propose using qu...
On the Efficiency of Selective Search
Hafizoglu, Fatih; Kucukoglu, Emre Can; Altıngövde, İsmail Sengör (2017-04-13)
Our work shows that the query latency for selective search over a topically partitioned collection can be reduced by up to 55%. We achieve this by physically storing the documents in each topical cluster across all shards and building a cluster-skipping index at each shard. Our approach also achieves uniform load balance among the shards.
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
D. Atilgan, İ. S. Altıngövde, and Ö. Ulusoy, “On the size of full element-indexes for XML keyword search,” 2012, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/34486.