Sciweavers

591 search results - page 91 / 119
» The complexity of XPath query evaluation
Sort
View
VLDB
1992
ACM
116views Database» more  VLDB 1992»
14 years 20 days ago
Supporting Lists in a Data Model (A Timely Approach)
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...
Joel E. Richardson
ER
2008
Springer
140views Database» more  ER 2008»
13 years 10 months ago
Managing the History of Metadata in Support for DB Archiving and Schema Evolution
Modern information systems, and web information systems in particular, are faced with frequent database schema changes, which generate the necessity to manage them and preserve the...
Carlo Curino, Hyun Jin Moon, Carlo Zaniolo
BNCOD
2003
104views Database» more  BNCOD 2003»
13 years 10 months ago
External Sorting with On-the-Fly Compression
Evaluating a query can involve manipulation of large volumes of temporary data. When the volume of data becomes too great, activities such as joins and sorting must use disk, and ...
John Yiannis, Justin Zobel
CASCON
1997
98views Education» more  CASCON 1997»
13 years 10 months ago
Similarity-based retrieval for diverse bookshelf software repository users
The paper presents a similarity-based retrieval framework for a software repository that aids the process of maintaining, understanding, and migrating legacy software systems [12]...
Igor Jurisica
CIKM
2010
Springer
13 years 6 months ago
Computing the top-k maximal answers in a join of ranked lists
Complex search tasks that utilize information from several data sources, are answered by integrating the results of distinct basic search queries. In such integration, each basic ...
Mirit Shalem, Yaron Kanza