5,720 Hits in 5.3 sec

Page 2401 of Mathematical Reviews Vol. , Issue 96d [page]

1996 Mathematical Reviews  
R. (3-CARL-SC; Ottawa, ON) Adaptive linear list reorganization under a generalized query system. (English summary) J. Appl. Probab. 32 (1995), no. 3, 793-804.  ...  In this paper, which to our knowledge represents the first reported result in this model of query processing, we first propose a simple model for a query generator which emits set queries.  ... 

A Novel Framework for Self-Organizing Lists in Environments with Locality of Reference: Lists-on-Lists

Abdelrahman Amer, B. J. Oommen
2006 Computer journal  
We examine the problem of self-organizing linear search lists, which are lists that react to queries received from an environment by running a heuristic to reorganize the records in order to minimize the  ...  We introduce a novel list organization framework that we call Lists-on-Lists (LOL), which regards the list as a set of sublists that are manageable in the same way that individual records are.  ...  A self-organizing linear search list is a list that runs a reorganization heuristic with (possibly) each access query with the hope of optimizing the linear search cost.  ... 
doi:10.1093/comjnl/bxl067 fatcat:cyqoifzxo5g77ajfuerkbcnv2u

Invisible loading

Azza Abouzied, Daniel J. Abadi, Avi Silberschatz
2013 Proceedings of the 16th International Conference on Extending Database Technology - EDBT '13  
For many types of structured data, this upfront effort is unjustifiable, so the data are processed directly over the file system using the Hadoop framework, despite the cumulative performance benefits  ...  of processing this data in an analytical database system.  ...  Adaptive merging does not guarantee a monotonically decreasing effort spent in data reorganization as it is sensitive to the size of the result-set requested by a query.  ... 
doi:10.1145/2452376.2452377 dblp:conf/edbt/AbouziedAS13 fatcat:y6qzgzdlr5bmbn4ihbewzya5um

An Adaptive Data Placement Scheme for Parallel Database Computer Systems

Kien A. Hua, Chiang Lee
1990 Very Large Data Bases Conference  
In this paper, we present an adaptive data placement scheme which balances computer work loads during query processing.  ...  The priority for adding cells to a retaining list is to select the larger cells first. This iteration process continues some PN runs out of cells.  ...  This probability can be obt:lirled by collecting statistical information from query/transaction processing.  ... 
dblp:conf/vldb/HuaL90 fatcat:oagm2ovfwzdrvkiwahuvkkkfpm

Designing Succinct Secondary Indexing Mechanism by Exploiting Column Correlations (Extended Version) [article]

Yingjun Wu, Jia Yu, Yuanyuan Tian, Richard Sidle, Ronald Barber
2019 arXiv   pre-print
Database administrators construct secondary indexes on data tables to accelerate query processing in relational database management systems (RDBMSs).  ...  We propose HERMIT, a succinct secondary indexing mechanism for modern RDBMSs.  ...  INTRODUCTION Modern relational database management systems (RDBMSs) support fast secondary indexes that help accelerate query processing in both transactional and analytical workloads.  ... 
arXiv:1903.11203v2 fatcat:dc2p2yzdo5cplkkhkq5g2bvpka

Answering approximate string queries on large data sets using external memory

Alexander Behm, Chen Li, Michael J. Carey
2011 2011 IEEE 27th International Conference on Data Engineering  
To answer queries, we develop a cost-based, adaptive algorithm that balances the I/O costs of retrieving candidate matches and accessing inverted lists.  ...  Experiments on large, real datasets verify that simply adapting existing algorithms to a disk-based setting does not work well and that our new techniques answer queries efficiently.  ...  Input: Inverted list addresses Ω(r) for a query string r Minimum number of lists to read minLists Output: A set C of candidate answers to be post- We begin by reading minLists inverted lists and process  ... 
doi:10.1109/icde.2011.5767856 dblp:conf/icde/BehmLC11 fatcat:yvlhae25d5abxaea2kzffiirye

Reinforcement Learning Interfaces for Biomedical Database Systems

I. Rudowsky, O. Kulyba, M. Kunin, S. Parsons, T. Raphan
2006 2006 International Conference of the IEEE Engineering in Medicine and Biology Society  
We have recently designed such a prototype system, but to maintain efficiency and a manageable metadata table, free formatted fields were designed as table entries.  ...  Studies of neural function that are carried out in different laboratories and that address different questions use a wide range of descriptors for data storage, depending on the laboratory and the individuals  ...  An experiment, for example, may consist of a set of trials testing a subject's locomotion on a linear treadmill while fixating on a target x centimeters away.  ... 
doi:10.1109/iembs.2006.260484 pmid:17946754 fatcat:kyqab7wl7rebfbgj34nlbpi5ki

Capsule Reviews

Fairouz Kamareddine
2007 Computer journal  
A self-organizing search list runs a reorganization heuristic in order to optimize the linear search cost. Much research on such heuristic algorithms has been carried out [1] .  ...  Dependent access refers to the situation when during a given time interval only a subset of the query set is predominantly accessed on the list and this subset THE COMPUTER JOURNAL, VOL. 50 NO. 2, 2007  ...  realisable systems programmed in the Pi-calculus is equivalent to TMs, and that either the $-calculus is a Church -Thesis system or it is not clear how the meaning of its programs can be formalized.  ... 
doi:10.1093/comjnl/bxm010 fatcat:aj5zoxoz3bg7vigyokcbounxxu

Information filtering and query indexing for an information retrieval model

Christos Tryfonopoulos, Manolis Koubarakis, Yannis Drougas
2009 ACM Transactions on Information Systems  
This article deals with the filtering problem that needs to be solved efficiently by each server: Given a database of continuous queries db and a document d , find all queries q ∈ db that match d .  ...  We present data structures and indexing algorithms that enable us to solve the filtering problem efficiently for large databases of queries expressed in the model AWP.  ...  Special thanks go to Theodoros Koutris and Paraskevi Raftopoulou for their help in the processing of the corpus and for reading previous versions of this article and providing useful comments on it.  ... 
doi:10.1145/1462198.1462202 fatcat:3opd7iavwjelxoyyx73omkwp5m

Online reorganization of databases

Gary H. Sockut, Balakrishna R. Iyer
2009 ACM Computing Surveys  
The issues, most of which involve design trade-offs, include use of partitions, the locus of control for the process that reorganizes (a background process or users' activities), reorganization by copying  ...  in a logstructured file system.  ...  ACKNOWLEDGMENTS A suggestion from Robert Goldberg led to the first author's early work in online reorganization. We thank these people for discussing issues in reorganization: Kiran Achyutuni, S.  ... 
doi:10.1145/1541880.1541881 fatcat:nbrjxa6h6fberhpb2blzmqoio4

Adaptive Indexing over Encrypted Numeric Data

Panagiotis Karras, Artyom Nikitin, Muhammad Saad, Rudrika Bhatt, Denis Antyukhov, Stratos Idreos
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
At the same time, to be efficiently managed, outsourced data should be indexed, and even adaptively so, as a side-effect of query processing.  ...  In this paper, we propose and analyze a scheme for lightweight and indexable encryption, based on linear-algebra operations.  ...  Acknowledgments We thank Nickolai Zeldovich, Jaideep Vaidya, and David Cash for fruitful discussions on this topic.  ... 
doi:10.1145/2882903.2882932 dblp:conf/sigmod/KarrasNSBAI16 fatcat:ttlebxi4gfhuhfoxoapkifygji

CCAM: a connectivity-clustered access method for networks and network computations

S. Shekhar, Duen-Ren Liu
1997 IEEE Transactions on Knowledge and Data Engineering  
Current Spatial Database Management Systems (SDBMS) provide e cient access methods and operators for point and range queries over collections of spatial points, line segments, and polygons.  ...  The expected I/O cost for many network operations can be reduced by maximizing the Weighted Connectivity Residue Ratio (WCRR), i.e., the chance that a pair of connected nodes that are more likely to be  ...  Finally, the interaction with the Network Engine group at Environmental Systems Research Institute helped in assessment of many ideas for suitability to GIS software systems such as ARC/INFO.  ... 
doi:10.1109/69.567054 fatcat:fdfevm3fzrbbtd3runl24kf5ne

HERMIT in action

Yingjun Wu, Jia Yu, Yuanyuan Tian, Richard Sidle, Ronald Barber
2019 Proceedings of the VLDB Endowment  
Database administrators construct secondary indexes on data tables to accelerate query processing in relational database management systems (RDBMSs).  ...  We recently introduced HERMIT, a succinct secondary indexing mechanism for modern RDBMSs.  ...  INTRODUCTION Modern relational database management systems (RDBMSs) support fast secondary indexes that help accelerate query processing * Work done during an internship at IBM Research -Almaden.  ... 
doi:10.14778/3352063.3352090 fatcat:bnexon2btbdodluewfee4u3ez4

Adaptive Merging on Phase Change Memory [article]

Wojciech Macyna, Michal Kukowski
2022 arXiv   pre-print
The key idea is to create index adaptively and incrementally as a side-product of query processing. As a result, the database table is indexed partially depending on the query workload.  ...  It further improves the system performance by 20% for databases where search queries interleave with data modifications.  ...  Adaptive merging is a process that creates or refines the database index as a side effect of query execution.  ... 
arXiv:2204.01667v1 fatcat:sbbogciqzbhzzm4v5iugknnx5e

Workload-aware indexing for keyword search in social networks

Truls A. Bjørklund, Michaela Götz, Johannes Gehrke, Nils Grimsmo
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
Keyword search provides a simple interface for exploring this content. However, a lot of the content is private, and a search system must enforce the privacy settings of the social network.  ...  We make two technical contributions: (1) Hea-pUnion, a novel union operator that improves processing of search queries with access control by up to a factor of two compared to the best previous solution  ...  We have implemented a system that constructs an index for a set of documents, and then processes search queries with the index.  ... 
doi:10.1145/2063576.2063656 dblp:conf/cikm/BjorklundGGG11 fatcat:34njfvxw7fh2rmwb3wejyxlebm
« Previous Showing results 1 — 15 out of 5,720 results