Open Access. Powered by Scholars. Published by Universities.®

Data Storage Systems Commons

Open Access. Powered by Scholars. Published by Universities.®

1034 Full-Text Articles 2672 Authors 189978 Downloads 70 Institutions

All Articles in Data Storage Systems

Faceted Search

1034 full-text articles. Page 1 of 49.

Analyzing The Performance Of Nosql Vs. Sql Databases For Spatial And Aggregate Queries, Sarthak Agarwal, KS Rajan 2017 International Institute of Information Technology Hyderabad Gachibowli, Hyderabad, India

Analyzing The Performance Of Nosql Vs. Sql Databases For Spatial And Aggregate Queries, Sarthak Agarwal, Ks Rajan

Free and Open Source Software for Geospatial (FOSS4G) Conference Proceedings

Relational databases have been around for a long time and spatial databases have exploited this feature for close to two decades. The recent past has seen the development of NoSQL non-relational databases, which are now being adopted for spatial object storage and handling, too. While SQL databases face scalability and agility challenges and fail to take the advantage of the cheap memory and processing power available these days, NoSQL databases can handle the rise in the data storage and frequency at which it is accessed and processed - which are essential features needed in geospatial scenarios, which do not deal with ...


Bim+Blockchain: A Solution To The Trust Problem In Collaboration?, Malachy Mathews, Dan Robles, Brian Bowe 2017 Dublin Institute of Technology

Bim+Blockchain: A Solution To The Trust Problem In Collaboration?, Malachy Mathews, Dan Robles, Brian Bowe

Conference papers

This paper provides an overview of historic and current organizational limitations emerging in the Architecture, Engineering, Construction, Building Owner / Operations (AECOO) Industry. It then provides an overview of new technologies that attempt to mitigate these limitations. However, these technologies, taken together, appear to be converging and creating entirely new organizational structures in the AEC industries. This may be characterized by the emergence of what is called the Network Effect and it’s related calculus. This paper culminates with an introduction to Blockchain Technology (BT) and it’s integration with the emergence of groundbreaking technologies such as Internet of Things (IoT ...


The Practicality Of Cloud Computing, Xiaohua (Cindy) Li 2017 Sacred Heart University

The Practicality Of Cloud Computing, Xiaohua (Cindy) Li

Cindy Li

Since its inception, cloud computing has become the current paradigm. Organizations of different size and type have embraced the concept because of its both technological and economic advantages. Sacred Heart University Library has recently published its newly designed website on the cloud. For a small academic library, what does it mean to put their online data on the cloud? This paper will analyze and discuss the advantages of cloud computing, and some potential obstacles created by it through the author’s observations. This paper hopes the uniqueness of the case will contribute to the improvement of cloud computing experience of ...


Resource Estimation For Large Scale, Real-Time Image Analysis On Live Video Cameras Worldwide, Caleb Tung, Yung-Hsiang Lu, Anup Mohan 2017 Purdue University

Resource Estimation For Large Scale, Real-Time Image Analysis On Live Video Cameras Worldwide, Caleb Tung, Yung-Hsiang Lu, Anup Mohan

The Summer Undergraduate Research Fellowship (SURF) Symposium

Thousands of public cameras live-stream an abundance of data to the Internet every day. If analyzed in real-time by computer programs, these cameras could provide unprecedented utility as a global sensory tool. For example, if cameras capture the scene of a fire, a system running image analysis software on their footage in real-time could be programmed to react appropriately (perhaps call firefighters). No such technology has been deployed at large scale because the sheer computing resources needed have yet to be determined. In order to help us build computer systems powerful enough to achieve such lifesaving feats, we developed a ...


Well-Tuned Algorithms For The Team Orienteering Problem With Time Windows, Aldy GUNAWAN, Hoong Chuin LAU, Pieter VANSTEENWEGEN, Kun LU 2017 Singapore Management University

Well-Tuned Algorithms For The Team Orienteering Problem With Time Windows, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen, Kun Lu

Research Collection School Of Information Systems

The Team Orienteering Problem with Time Windows (TOPTW) is the extension of the Orienteering Problem (OP) where each node is limited by a predefined time window during which the service has to start. The objective of the TOPTW is to maximize the total collected score by visiting a set of nodes with a limited number of paths. We propose two algorithms, Iterated Local Search and a hybridization of Simulated Annealing and Iterated Local Search (SAILS), to solve the TOPTW. As indicated in multiple research works on algorithms for the OP and its variants, determining appropriate parameter values in a statistical ...


Time-Aware Conversion Prediction, Wendi JI, Xiao Ling WANG, Feida ZHU 2017 Singapore Management University

Time-Aware Conversion Prediction, Wendi Ji, Xiao Ling Wang, Feida Zhu

Research Collection School Of Information Systems

The importance of product recommendation has been well recognized as a central task in business intelligence for e-commerce websites. Interestingly, what has been less aware of is the fact that different products take different time periods for conversion. The “conversion” here refers to actually a more general set of pre-defined actions, including for example purchases or registrations in recommendation and advertising systems. The mismatch between the product’s actual conversion period and the application’s target conversion period has been the subtle culprit compromising many existing recommendation algorithms.The challenging question: what products should be recommended for a given time ...


On Efficiently Finding Reverse K-Nearest Neighbors Over Uncertain Graphs, Yunjun GAO, Xiaoye MIAO, Gang CHEN, Baihua ZHENG, Deng CAI, Huiyong CUI 2017 Singapore Management University

On Efficiently Finding Reverse K-Nearest Neighbors Over Uncertain Graphs, Yunjun Gao, Xiaoye Miao, Gang Chen, Baihua Zheng, Deng Cai, Huiyong Cui

Research Collection School Of Information Systems

Reverse k-nearest neighbor (RkNN) query on graphs returns the data objects that take a specified query object q as one of their k-nearest neighbors. It has significant influence in many real-life applications including resource allocation and profile-based marketing. However, to the best of our knowledge, there is little previous work on RkNN search over uncertain graph data, even though many complex networks such as traffic networks and protein–protein interaction networks are often modeled as uncertain graphs. In this paper, we systematically study the problem of reversek-nearest neighbor search on uncertain graphs (UG-RkNN search for short), where graph edges contain ...


Indexing Metric Uncertain Data For Range Queries And Range Joins, Lu CHEN, Yunjun GAO, Aoxiao ZHONG, Christian S. JENSEN, Gang CHEN, Baihua ZHENG 2017 Singapore Management University

Indexing Metric Uncertain Data For Range Queries And Range Joins, Lu Chen, Yunjun Gao, Aoxiao Zhong, Christian S. Jensen, Gang Chen, Baihua Zheng

Research Collection School Of Information Systems

Range queries and range joins in metric spaces have applications in many areas, including GIS, computational biology, and data integration, where metric uncertain data exist in different forms, resulting from circumstances such as equipment limitations, high-throughput sequencing technologies, and privacy preservation. We represent metric uncertain data by using an object-level model and a bi-level model, respectively. Two novel indexes, the uncertain pivot B+-tree (UPB-tree) and the uncertain pivot B+-forest (UPB-forest), are proposed in order to support probabilistic range queries and range joins for a wide range of uncertain data types and similarity metrics. Both index structures use a ...


Pivot-Based Metric Indexing, Lu CHEN, Yunjun GAO, Baihua ZHENG, Christian S. JENSEN, Hanyu YANG, Keyu YANG 2017 Singapore Management University

Pivot-Based Metric Indexing, Lu Chen, Yunjun Gao, Baihua Zheng, Christian S. Jensen, Hanyu Yang, Keyu Yang

Research Collection School Of Information Systems

The general notion of a metric space encompasses a diverse range of data types and accompanying similarity measures. Hence, metric search plays an important role in a wide range of settings, including multimedia retrieval, data mining, and data integration. With the aim of accelerating metric search, a collection of pivot-based indexing techniques for metric data has been proposed, which reduces the number of potentially expensive similarity comparisons by exploiting the triangle inequality for pruning and validation. However, no comprehensive empirical study of those techniques exists. Existing studies each offers only a narrower coverage, and they use different pivot selection strategies ...


Geometric Approaches For Top-K Queries [Tutorial], Kyriakos MOURATIDIS 2017 Singapore Management University

Geometric Approaches For Top-K Queries [Tutorial], Kyriakos Mouratidis

Research Collection School Of Information Systems

Top-k processing is a well-studied problem with numerous applications that is becoming increasingly relevant with the growing availability of recommendation systems and decision-making software. The objective of this tutorial is twofold. First, we will delve into the geometric aspects of top-k processing. Second, we will cover complementary features to top-k queries, with strong practical relevance and important applications, that have a computational geometric nature. The tutorial will close with insights in the effect of dimensionality on the meaningfulness of top-k queries, and interesting similarities to nearest neighbor search.


Basket-Sensitive Personalized Item Recommendation, Duc Trong LE, Hady Wirawan LAUW, Yuan FANG 2017 Singapore Management University

Basket-Sensitive Personalized Item Recommendation, Duc Trong Le, Hady Wirawan Lauw, Yuan Fang

Research Collection School Of Information Systems

Personalized item recommendation is useful in narrowing down the list of options provided to a user. In this paper, we address the problem scenario where the user is currently holding a basket of items, and the task is to recommend an item to be added to the basket. Here, we assume that items currently in a basket share some association based on an underlying latent need, e.g., ingredients to prepare some dish, spare parts of some device. Thus, it is important that a recommended item is relevant not only to the user, but also to the existing items in ...


Semantic Visualization For Short Texts With Word Embeddings, Van Minh Tuan LE, Hady Wirawan LAUW 2017 Singapore Management University

Semantic Visualization For Short Texts With Word Embeddings, Van Minh Tuan Le, Hady Wirawan Lauw

Research Collection School Of Information Systems

Semantic visualization integrates topic modeling and visualization, such that every document is associated with a topic distribution as well as visualization coordinates on a low-dimensional Euclidean space. We address the problem of semantic visualization for short texts. Such documents are increasingly common, including tweets, search snippets, news headlines, or status updates. Due to their short lengths, it is difficult to model semantics as the word co-occurrences in such a corpus are very sparse. Our approach is to incorporate auxiliary information, such as word embeddings from a larger corpus, to supplement the lack of co-occurrences. This requires the development of a ...


One-To-Cloud One-Time Pad Data Encryption: Introducing Virtual Prototyping With Pspice, Paul Tobin, Lee Tobin, Roberto Gandia Blanquer DR, Michael McKeever, Jonathan Blackledge Professor 2017 Dublin Institute of Technology

One-To-Cloud One-Time Pad Data Encryption: Introducing Virtual Prototyping With Pspice, Paul Tobin, Lee Tobin, Roberto Gandia Blanquer Dr, Michael Mckeever, Jonathan Blackledge Professor

Conference papers

In this paper, we examine the design and application of a one-time pad encryption system for protecting data stored in the Cloud. Personalising security using a one-time pad generator at the client-end protects data from break-ins, side-channel attacks and backdoors in public encryption algorithms. The one-time pad binary sequences were obtained from modified analogue chaos oscillators initiated by noise and encoded client data locally. Specific ``one-to-Cloud'' storage applications returned control back to the end user but without the key distribution problem normally associated with one-time pad encryption. Development of the prototype was aided by ``Virtual Prototyping'' in the latest version ...


Smartgarden, Samuel S. Lees, Matthew T. Lindly 2017 California Polytechnic State University, San Luis Obispo

Smartgarden, Samuel S. Lees, Matthew T. Lindly

Computer Engineering

The problem that the SmartGarden project seeks to solve is the challenge of watering succulents correctly and maintaining consistent plant health. Too much water can cause root rot and drowning while too little water can cause dehydration and starvation.
The SmartGarden solves this common problem by configuring a Raspberry Pi to measure soil moisture, store the data to an AWS server in the cloud, and water the succulent when necessary, informing the user by providing both a web-interface and a variety of notifications.


Cpu Db Data Visualization, Ruchita Patel, Marek Moreno 2017 California Polytechnic State University, San Luis Obispo

Cpu Db Data Visualization, Ruchita Patel, Marek Moreno

Computer Engineering

Given the CPU database from Stanford, we wanted to create something that portrayed the data in a more visually pleasing way. The CPU database website wanted a web page that would allow users to create graphs based on the processor data from the database. The web page would allow users to select different data from the database and create the graphs they wanted to gain insight into the decades of processor data.


Sap: Improving Continuous Top-K Queries Over Streaming Data, Rui ZHU, Bin WANG, Xiaochun YANG, Baihua ZHENG, Guoren WANG 2017 Singapore Management University

Sap: Improving Continuous Top-K Queries Over Streaming Data, Rui Zhu, Bin Wang, Xiaochun Yang, Baihua Zheng, Guoren Wang

Research Collection School Of Information Systems

Continuous top-k query over streaming data is a fundamental problem in database. In this paper, we focus on the sliding window scenario, where a continuous top-k query returns the top-k objects within each query window on the data stream. Existing algorithms support this type of queries via incrementally maintaining a subset of objects in the window and try to retrieve the answer from this subset as much as possible whenever the window slides. However, since all the existing algorithms are sensitive to query parameters and data distribution, they all suffer from expensive incremental maintenance cost. In this paper, we propose ...


Hospital Readmission And Social Risk Factors Identified From Physician Notes, Amol Navathe, Feiran Zhong, Victor J. Lei, Frank Y. Chang, Margarita Sordo, Maxim Topaz, Shamkant B. Navathe, Roberto A. Rocha, Li Zhou 2017 University of Pennsylvania

Hospital Readmission And Social Risk Factors Identified From Physician Notes, Amol Navathe, Feiran Zhong, Victor J. Lei, Frank Y. Chang, Margarita Sordo, Maxim Topaz, Shamkant B. Navathe, Roberto A. Rocha, Li Zhou

Research Briefs

No abstract provided.


Developing And Implementing An Online Research Data Repository For Your University Or College Campus, Raymond J. Uzwyshyn 2017 Texas State University

Developing And Implementing An Online Research Data Repository For Your University Or College Campus, Raymond J. Uzwyshyn

Digital Initiatives Symposium

Data-driven research is becoming increasingly important on university and college campuses. Most US federal and many international granting agencies mandatorily require that researchers applying for public grants possess a data management plan and make their research and data publically available through online access. This presentation overviews online research data repositories and implementation strategies for university and college campus libraries. The presentation pragmatically surveys this newer technology landscape and how organizations can begin to think about and implement an online data research repository. This session will survey the landscape but also makes use of practical example from Texas State University and ...


Encrypted Data Processing With Homomorphic Re-Encryption, Wenxiu DING, Zheng YAN, Robert H. DENG 2017 Singapore Management University

Encrypted Data Processing With Homomorphic Re-Encryption, Wenxiu Ding, Zheng Yan, Robert H. Deng

Research Collection School Of Information Systems

Cloud computing offers various services to users by re-arranging storage and computing resources. In order to preserve data privacy, cloud users may choose to upload encrypted data rather than raw data to the cloud. However, processing and analyzing encrypted data are challenging problems, which have received increasing attention in recent years. Homomorphic Encryption (HE) was proposed to support computation on encrypted data and ensure data confidentiality simultaneously. However, a limitation of HE is it is a single user system, which means it only allows the party that owns a homomorphic decryption key to decrypt processed ciphertexts. Original HE cannot support ...


A Data-Driven Approach For Benchmarking Energy Efficiency Of Warehouse Buildings, Wee Leong LEE, Kar Way TAN, Zui Young LIM 2017 Singapore Management University

A Data-Driven Approach For Benchmarking Energy Efficiency Of Warehouse Buildings, Wee Leong Lee, Kar Way Tan, Zui Young Lim

Research Collection School Of Information Systems

This study proposes adata-driven approach for benchmarking energy efficiency of warehouse buildings.Our proposed approach provides an alternative to the limitation of existingbenchmarking approaches where a theoretical energy-efficient warehouse was usedas a reference. Our approach starts by defining the questions needed to capturethe characteristics of warehouses relating to energy consumption. Using an existingdata set of warehouse building containing various attributes, we first cluster theminto groups by their characteristics. The warehouses characteristics derivedfrom the cluster assignments along with their past annual energy consumptionare subsequently used to train a decision tree model. The decision tree providesa classification of what factors contribute to ...


Digital Commons powered by bepress