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
Incremental view maintenance in object-oriented databases
Date
1998-06-01
Author
Alhajj, R
Polat, Faruk
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
177
views
0
downloads
Cite This
A database management system should support views to facilitate filtering of information in order to have only necessary and required information available to users with minimal delay Although a lot of research efforts concentrated on views within the conventional relational model, much more effort is required when object-oriented models are considered. However, supporting views is only a step forward in achieving the purpose that requires improving the performance of the system by considering incremental maintenance of views instead of recomputing a view from scratch each time if is accessed.
Subject Keywords
Computer Networks and Communications
,
Management Information Systems
URI
https://hdl.handle.net/11511/43324
Journal
DATA BASE FOR ADVANCES IN INFORMATION SYSTEMS
DOI
https://doi.org/10.1145/313310.313338
Collections
Department of Computer Engineering, Article
Suggestions
OpenMETU
Core
Cost-Aware Strategies for Query Result Caching in Web Search Engines
Ozcan, Rifat; Altıngövde, İsmail Sengör; Ulusoy, Ozgor (Association for Computing Machinery (ACM), 2011-05-01)
Search engines and large-scale IR systems need to cache query results for efficiency and scalability purposes. Static and dynamic caching techniques (as well as their combinations) are employed to effectively cache query results. In this study, we propose cost-aware strategies for static and dynamic caching setups. Our research is motivated by two key observations: (i) query processing costs may significantly vary among different queries, and (ii) the processing cost of a query is not proportional to its po...
Querying Web Metadata: Native score management and text support in databases
Ozsoyoglu, G; Altıngövde, İsmail Sengör; Al-Hamdani, A; Ozel, SA; Ulusoy, O; Ozsoyoglu, ZM (Association for Computing Machinery (ACM), 2004-12-01)
In this article, we discuss the issues involved in adding a native score management system to object-relational databases; to be used in querying Web metadata (that describes the semantic content of Web resources). The Web metadata model is based on topics (representing entities), relationships among topics (called metalinks), and importance scores (sideway values) of topic and metalinks. We extend database relations with scoring functions and importance scores. We add to SQL score-management clauses with w...
Cache-Based Query Processing for Search Engines
Cambazoglu, B. Barla; Altıngövde, İsmail Sengör; Ozcan, Rifat; Ulusoy, Ozgur (Association for Computing Machinery (ACM), 2012-11-01)
In practice, a search engine may fail to serve a query due to various reasons such as hardware/network failures, excessive query load, lack of matching documents, or service contract limitations (e.g., the query rate limits for third-party users of a search service). In this kind of scenarios, where the backend search system is unable to generate answers to queries, approximate answers can be generated by exploiting the previously computed query results available in the result cache of the search engine. In...
Comparison of feature-based and image registration-based retrieval of image data using multidimensional data access methods
Arslan, Serdar; Yazıcı, Adnan; Sacan, Ahmet; Toroslu, İsmail Hakkı; Acar, Esra (Elsevier BV, 2013-07-01)
In information retrieval, efficient similarity search in multimedia collections is a critical task In this paper, we present a rigorous comparison of three different approaches to the image retrieval problem, including cluster-based indexing, distance-based indexing, and multidimensional scaling methods. The time and accuracy trade-offs for each of these methods are demonstrated on three different image data sets. Similarity of images is obtained either by a feature-based similarity measure using four MPEG-...
A monolithic approach to automated composition of semantic web services with the Event Calculus
Okutan, Cagla; Çiçekli, Fehime Nihan (Elsevier BV, 2010-07-01)
In this paper, a web service composition and execution framework is presented for semantically -annotated web services. A monolithic approach to automated web service composition and execution problem is chosen, which provides some benefits by separating composition and execution phases. An AI planning method using a logical formalism, namely Abductive Event Calculus, is chosen for the composition phase. This formalism allows one to generate a narrative of actions and temporal orderings using abductive plan...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
R. Alhajj and F. Polat, “Incremental view maintenance in object-oriented databases,”
DATA BASE FOR ADVANCES IN INFORMATION SYSTEMS
, pp. 52–64, 1998, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/43324.