*Ingenierías y Ciencias de la Computación (Proyecto VLIR): Recent submissions

  • Interval Query Indexing for Efficient Stream Processing 
    Wu Kun-Lung; Chen Shyh-Kwei; Yu Philip S (2004)
    A large number of continual range queries can be issued against a data stream. Usually, a main memory-based query index with a small storage cost and a fast search time is needed, especially if the stream is rapid. In this ...
  • Scalable Sequential Pattern Mining for Biological Sequences * 
    Wang Ke; Xu Yabo; Xu Jeffrey; Yu (2004)
    Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., " don't care ") of arbitrary size. Mining frequent patterns in such sequences faces a different type of explosion than in ...
  • Evaluating Window Joins over Punctuated Streams 
    Ding Luping; Rundensteiner Elke A (2004)
    We explore join optimizations in the presence of both time-based constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named PWJoin that exploits such combined constraints ...
  • Efficient processing of XML twig patterns with parent child edges: A Look-ahead approach 
    Lu Jiaheng; Chen Ting; Wang Tok; Ling (2004)
    With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database. A number of algorithms have been proposed ...
  • Framework and Algorithms for Trend Analysis in Massive Temporal Data Sets 
    Gollapudi Sreenivas; Sivakumar D (2004)
    Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In this paper, we propose a framework based on ...
  • Energy Management Schemes for Memory-Resident Database Systems 
    Pisharath Jayaprakash; Choudhary Alok; Kandemir Mahmut (2004)
    With the tremendous growth of system memories, memory-resident databases are increasingly becoming important in various domains. Newer memories provide a structured way of storing data in multiple chips, with each chip ...
  • Organizing Structured Web Sources by Query Schemas: A Clustering Approach * 
    He Bin; Tao Tao; Kevin Chen-Chuan; Chang (2004)
    In the recent years, the Web has been rapidly " deepened " with the prevalence of databases online. On this deep Web, many sources are structured by providing structured query interfaces and results. Organizing such ...
  • Discovering Frequently Changing Structures from Historical Structural Deltas of Unordered XML 
    Zhao Qiankun; Sourav †; Bhowmick S; Mohania Mukesh; Kambayashi Yahiko; Cais § † (2004)
    Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic in real applications. To the best of our ...
  • QFilter: Fine-Grained Run-Time XML Access Control via NFA-based Query Rewriting 
    Luo Bo; Lee Dongwon; Lee Wang-Chien; Liu Peng (2004)
    At present, most of the state-of-the-art solutions for XML access controls are either (1) document-level access control techniques that are too limited to support fine-grained security enforcement; (2) view-based approaches ...
  • A Local Search Mechanism for Peer-to-Peer Networks 
    Kalogeraki Vana; Gunopulos Dimitrios; Zeinalipour-Yazti D (2002)
    One important problem in peer-to-peer (P2P) networks is searching and retrieving the correct information. However , existing searching mechanisms in pure peer-to-peer networks are inefficient due to the decentralized nature ...
  • EXPedite: A System for Encoded XML Processing 
    Chen Yi; Mihaila George A; Davidson Susan B; Padmanabhan Sriram (2004)
    As XML becomes an increasingly popular format for information exchange, the efficient processing of broadcast XML data on a constrained device (for example, a cell phone or a PDA) becomes a critical task. In this paper we ...
  • On the Complexity of Computing Peer Agreements for Consistent Query Answering in Peer-to-Peer Data Integration Systems Keywords 
    Greco Gianluigi; Scarcello Francesco (2005)
    Peer-to-Peer (P2P) data integration systems have recently attracted significant attention for their ability to manage and share data dispersed over different peer sources. While integrating data for answering user queries, ...
  • Relational Computation for Mining Association Rules from XML Data 
    Liu Hong-Cheu; Zeleznikow John (2005)
    We develop a fixpoint operator for computing large item sets and demonstrate three query paradigm solutions for association rule mining that use the idea of least fixpoint computation and indicates some optimisation issues. ...
  • Structured Queries in XML Retrieval 
    Kamps Jaap; Marx Maarten; Rijke Maarten De; Sigurbjörnssonsigurbj¨sigurbjörnsson B ¨ Orkur (2005)
    Document-centric XML is a mixture of text and structure. With the increased availability of document-centric XML content comes a need for query facilities in which both structural constraints and constraints on the content ...
  • QED: A Novel Quaternary Encoding to Completely Avoid Re-labeling in XML Updates 
    Li Changqing; Wang Tok; Ling (2005)
    The method of assigning labels to the nodes of the XML tree is called a labeling scheme. Based on the labels only, both ordered and un-ordered queries can be processed without accessing the original XML file. One more ...
  • DSAC: Integrity for Outsourced Databases with Signature Aggregation and Chaining 
    Narasimha Maithili; Tsudik Gene (2005)
    Database outsourcing is an important trend which involves data owners farming out their data management needs to an external service provider. One important requirement is to maintain the integrity and authenticity of ...
  • The case for access control on XML relationships 
    Finance Béatrice; Medjdoub Saïda; Pucheral Philippe (2005)
    With the emergence of XML as the de facto standard to exchange and disseminate information, the problem of regulating access to XML documents has attracted a considerable attention in recent years. Existing models attach ...
  • Internet Scale String Attribute Publish/Subscribe Data Networks 
    Aekaterinidis Ioannis; Triantafillou Peter (2005)
    With this work we aim to make a threefold contribution. We first address the issue of supporting efficiently queries over string-attributes involving prefix, suffix, containment, and equality operators in large-scale data ...
  • Generalized Contextualization Method for XML Information Retrieval 
    Arvola Paavo; Junkkari Marko; Kekäläinen Jaana (2005)
    A general re-weighting method, called contextualization, for more efficient element ranking in XML retrieval is introduced. Re-weighting is based on the idea of using the ancestors of an element as a context: if the element ...
  • Consistent Query Answering under Key and Exclusion Dependencies: Algorithms and Experiments General Terms 
    Grieco Luca; Lembo Domenico; Rosati Riccardo; Ruzzi Marco (2005)
    Research in consistent query answering studies the definition and computation of " meaningful " answers to queries posed to inconsistent databases, i.e., databases whose data do not satisfy the integrity constraints (ICs) ...

Search DSpace


Browse

My Account