Filters








117,331 Hits in 3.9 sec

Partial index replicated and distributed scheme for full-text search on wireless broadcast

VIKAS GOEL, ANIL KUMAR AHLAWAT, M N GUPTA
2015 Sadhana (Bangalore)  
The replication in B+ tree may be done up to a certain level of the indexed informat+ion (Data).  ...  The partial replication in the B+ tree indexing scheme is proposed to extend the existing full text search indexing scheme.  ...  A sample B+ Tree. Figure 4 . 4 Figure 4. Inverted list + index tree in proposed partial index replicated and distributed scheme.  ... 
doi:10.1007/s12046-015-0435-x fatcat:dobvdffnerfmzhbobddvwv5r5a

The Replication in Varying Fanout Indexing Technique for Skewed Access Patterns in the Wireless Mobile Environments

Mani Pandey, Vikas Goel
2012 International Journal of Computer Applications  
We purpose a varying fanout indexing technique with replication for skewed data over a single wireless communication channel.  ...  In this paper, we explore the balanced and imbalanced index tree with varying fanout over skewed data.  ...  B + -Tree Based Indexing The B+ Tree based distributed indexing is a technique in which index is partially replicated introduced in [1] provides a method to multiplex it together with the corresponding  ... 
doi:10.5120/8027-1252 fatcat:sunwikibhbeghozbyvus3lpxpi

STI-BT: A Scalable Transactional Index

Nuno Diegues, Paolo Romano
2016 IEEE Transactions on Parallel and Distributed Systems  
STI-BT is organized as a distributed B+Tree and adopts an innovative design that allows to achieve high efficiency in large-scale, elastic DKV stores.  ...  In this article we present STI-BT, a highly scalable, transactional index for Distributed Key-Value (DKV) stores.  ...  Another design of a distributed B + Tree was proposed in Minuet [18] (also on top of Sinfonia).  ... 
doi:10.1109/tpds.2015.2485267 fatcat:yl4upwe6e5hhddh64u4lm64uea

STI-BT: A Scalable Transactional Index

Nuno Diegues, Paolo Romano
2014 2014 IEEE 34th International Conference on Distributed Computing Systems  
STI-BT is organized as a distributed B+Tree and adopts an innovative design that allows to achieve high efficiency in large-scale, elastic DKV stores.  ...  In this article we present STI-BT, a highly scalable, transactional index for Distributed Key-Value (DKV) stores.  ...  Another design of a distributed B + Tree was proposed in Minuet [18] (also on top of Sinfonia).  ... 
doi:10.1109/icdcs.2014.19 dblp:conf/icdcs/DieguesR14 fatcat:udjkv7myhvdmbo7wbyejwfkqve

OPTIMIZATION OF LOCAL PARALLEL INDEX (LPI) IN PARALLEL/DISTRIBUTED DATABASE SYSTEMS

Mohamed Chakraoui
2016 International Journal of GEOMATE  
The widespread growth of data has created many problems for businesses, such as delay requests; in this paper, we propose several methods of partitioning an index B*Tree in multi-processor machines in  ...  When optimizing, indexing automatically comes to mind; we distinguish two types of indexing: B*Tree and Bitmap.  ...  Indexes are divided into two major types, Bitmap index and B*Tree index.  ... 
doi:10.21660/2016.27.1322 fatcat:dsifoha6cnfhddxkkwqujufz5u

Shepherdable Indexes and Persistent Search Services for Mobile Users [chapter]

Michael Higgins, Dominic Widdows, Magesh Balasubramanya, Peter Lucas, David Holstius
2006 Lecture Notes in Computer Science  
We describe a range of designs for supporting rich search queries in a peer-to-peer network.  ...  Several abstract data structures are built upon this framework, supporting dataset management, lexical search, and distributed GIS interfaces in an application called the Geobrowser.  ...  ., by sharing a global keyword lexicon. Replication of search structures, such as B-trees, is not new [9] [10] [11] .  ... 
doi:10.1007/11914952_39 fatcat:rcwldfflxffzdo4krl5tpkta5i

Does the T-PTP Test Tell Us Anything We Want to Know?

John Harshman, Richard Olmstead
2001 Systematic Biology  
, generating a large number of replicate data sets.  ...  The Bremer index of a clade for the original data set is compared with the distribution of Bremer indices of that clade over many randomized data sets.  ...  Carpenter for sending me a le containing the data set of Ballard et al. (1992) .  ... 
doi:10.1080/10635150121530 pmid:12116932 fatcat:scvjmzatcrexregf4hxreth2sm

A Decentralized Storage Scheme for Multi-Dimensional Range Queries over Sensor Networks

Lei Xie, Lijun Chen, Daoxu Chen, Li Xie
2009 2009 15th International Conference on Parallel and Distributed Systems  
We build a distributed k-d tree based index structure over sensor network, so as to efficiently map high dimensional event data to a two-dimensional space of sensors while preserving the proximity of events  ...  We propose a dynamic programming based methodology to control the granularity of the index tree in an optimized approach, and an optimized routing scheme for range query processing to achieve best energy  ...  Fig.2 (a) depicts the k-d tree based index structure and Fig.2(b) represents the corresponding zone code and boundaries.  ... 
doi:10.1109/icpads.2009.24 dblp:conf/icpads/Xie0CX09 fatcat:a52dglvlr5ehjiub4x6svqmcdi

DIFS: a distributed index for features in sensor networks

Benjamin Greenstein, Sylvia Ratnasamy, Scott Shenker, Ramesh Govindan, Deborah Estrin
2003 Ad hoc networks  
distributed index that provides for efficient index construction and range searches.  ...  Sensor networks pose new challenges in the collection and distribution of data.  ...  Simple Quad Tree Approach Perhaps the simplest approach to indexing values in a sensor network is to build a spatially distributed quad tree of histograms.  ... 
doi:10.1016/s1570-8705(03)00010-6 fatcat:cuxarr3lhndz5ob2c5iwshjmi4

Efficient index and data allocation for wireless broadcast services

Shou-Chih Lo, Arbee L.P. Chen
2007 Data & Knowledge Engineering  
The indexing and scheduling of broadcast data play a key role in this problem.  ...  In this paper, we formulate the index and data allocation problem and propose a solution that can adapt to any number of broadcast channels.  ...  B 2 1 C A D index tree (a) (b) (c) We call the broadcast data allocated from an induced tree a broadcast segment (see Fig. 10c ).  ... 
doi:10.1016/j.datak.2006.02.002 fatcat:22e5z7gzijd2nkai4khf6ak77u

Energy-Efficient Tree-Based Indexing Schemes for Information Retrieval in Wireless Data Broadcast [chapter]

Jiaofei Zhong, Weili Wu, Yan Shi, Xiaofeng Gao
2011 Lecture Notes in Computer Science  
B + -Tree Distributed Index Scheme (BTD) is a popular index scheme for wireless data broadcast, which has been extended by many research works.  ...  In this paper, we are trying to answer one question: can alphabetic Huffman tree replace B + -tree and provide better performance?  ...  B + -Tree Distributed Index Scheme (BTD) is a popular index scheme for wireless data broadcast.  ... 
doi:10.1007/978-3-642-20152-3_25 fatcat:xolstzh7bjg5rjpg5xrvykopey

Data on air: organization and access

T. Imielinski, S. Viswanathan, B.R. Badrinath
1997 IEEE Transactions on Knowledge and Data Engineering  
First, this paper describes two algorithms namely, (1, m) Indexing and Distributed Indexing, for multiplexing data and its clustering index.  ...  Organizing massive amount of data on wireless communication networks in order to provide fast and low power access to users equipped with palmtops, is a new challenge to the data management and telecommunication  ...  Fig. 7 illustrates the index distribution when the entire path from root of the index tree to each index buckets b i is replicated. The replication is just before the occurrence of b i .  ... 
doi:10.1109/69.599926 fatcat:6cnhrwophrfz5lo55lbga6toee

Clone-based Data Index in Cloud Storage Systems

Jing He, Yue Wu, Yang Fu, Wei Zhou, J.C.M. Kao, W.-P. Sung
2016 MATEC Web of Conferences  
Then, a clone based B+ tree structure is proposed to achieve high performance and adapt dynamic environment. The experimental results show that our clone-based solution has high efficiency.  ...  To solve these problems, we propose a double-layer index structure that overcomes the throughput limitation of single point server.  ...  In figure 2(b) , a clone tree A' is created from original B+ tree A. Firstly, there is only one index node that is the root node A needs to be replicated as A'.  ... 
doi:10.1051/matecconf/20166305004 fatcat:2ufr7pichbhdhlexhlkvoalkbm

Analyzing design choices for distributed multidimensional indexing

Beomseok Nam, Alan Sussman
2011 Journal of Supercomputing  
In this paper, we discuss several ways of distributing a multidimensional index in order to speed up access to large distributed scientific datasets.  ...  to choose a distributed multidimensional index for a specific data analysis application.  ...  However, replication Fig. 1 Centralized Indexing -A single index server stores all the index tree nodes.  ... 
doi:10.1007/s11227-011-0567-7 fatcat:z3vx6zzgx5fkbap5pyunhrwpwm

Lithium

Jacob Gorm Hansen, Eric Jul
2010 Proceedings of the 1st ACM symposium on Cloud computing - SoCC '10  
To address the limitations of centralized shared storage for cloud computing, we are building Lithium, a distributed storage system designed specifically for virtualization workloads running in large-scale  ...  The design of Lithium borrows ideas and techniques originating from research into Byzantine Fault Tolerance systems and popularized by distributed version control software, and demonstrates their practical  ...  Instead, Lithium uses a 64-bit extent indexed B-tree to track logical block locations in the log.  ... 
doi:10.1145/1807128.1807134 dblp:conf/cloud/HansenJ10 fatcat:ampqjhtidjdylgwt74h7sjcwxe
« Previous Showing results 1 — 15 out of 117,331 results