Sciweavers

    358 search results - page 2 / 72
    » On a model of indexability and its bounds for range queries
    Sort
    View
    ICDE
    2006
    IEEE
    196views Database» more  ICDE 2006»
    Closure-Tree: An Index Structure for Graph Queries
    14 years 7 months ago
    Closure-Tree: An Index Structure for Graph Queries
    Download  www.cs.ucsb.edu
    Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
    Huahai He, Ambuj K. Singh
    claim paper
    Read More »
    PODS
    2009
    ACM
    130views Database» more  PODS 2009»
    Secondary indexing in one dimension: beyond b-trees and bitmap indexes
    14 years 6 months ago
    Secondary indexing in one dimension: beyond b-trees and bitmap indexes
    Download  www.itu.dk
    Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
    Rasmus Pagh, Srinivasa Rao Satti
    claim paper
    Read More »
    INFOSCALE
    2007
    ACM
    205views Information Technology» more  INFOSCALE 2007»
    SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
    13 years 7 months ago
    SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
    Download  homepage.fudan.edu.cn
    Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
    Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
    claim paper
    Read More »
    VLDB
    2004
    ACM
    134views Database» more  VLDB 2004»
    A Privacy-Preserving Index for Range Queries
    13 years 11 months ago
    A Privacy-Preserving Index for Range Queries
    Download  www.ics.uci.edu
    Database outsourcing is an emerging data management paradigm which has the potential to transform the IT operations of corporations. In this paper we address privacy threats in da...
    Bijit Hore, Sharad Mehrotra, Gene Tsudik
    claim paper
    Read More »
    DCC
    2008
    IEEE
    118views Computer Graphics» more  DCC 2008»
    Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
    14 years 5 months ago
    Practical Entropy-Bounded Schemes for O(1)-Range Minimum Queries
    Download  www-ab.informatik.uni-tuebingen.de
    The Range Minimum Query (RMQ) Problem is to preprocess an array A of length n in O(n) time such that subsequent on-line queries asking for the position of a minimal element between...
    Johannes Fischer, Volker Heun, Horst Martin St&uum...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.