• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 46 matches

• 2020
• 
  Jing Huang, Cheng Chi, Wei Wang, Haining Huang:
  A Sequence-Scheduled and Query-Based MAC Protocol for Underwater Acoustic Networks with a Mobile Node. J. Commun. Inf. Networks 5(2): 150-159 (2020)
• 
  Ying Li, Jinyu Zhan, Wei Jiang, Junting Wu, Jianping Zhu:
  An FPGA based Network Interface Card with Query Filter for Storage Nodes of Big Data Systems. ASP-DAC 2020: 556-561
• 
  Stefan Halfpap, Rainer Schlosser:
  Exploration of Dynamic Query-Based Load Balancing for Partially Replicated Database Systems with Node Failures. CIKM 2020: 3409-3412
• 
  Yutaro Bessho, Yuto Hayamizu, Kazuo Goda, Masaru Kitsuregawa:
  PhoeniQ: Failure-Tolerant Query Processing in Multi-node Environments. DEXA (1) 2020: 71-85
• 
  Xiaoshuang Chen, Longbin Lai, Lu Qin, Xuemin Lin:
  StructSim: Querying Structural Node Similarity at Billion Scale. ICDE 2020: 1950-1953
• 
  Yuchen Bian, Jun Huan, Dejing Dou, Xiang Zhang:
  Rethinking Local Community Detection: Query Nodes Replacement. ICDM 2020: 930-935
• 2019
• 
  Junlu Wang, YuLong Song, Baoyan Song:
  Node Similarity Top-k Query of the Large-Scale Dynamic Graph With Weak Repeated Path Constraint. IEEE Access 7: 64431-64441 (2019)
• 
  Xiaobo Yin, Shunxiang Zhang, Hui Xu:
  Node Attributed Query Access Algorithm Based on Improved Personalized Differential Privacy Protection in Social Network. Int. J. Wirel. Inf. Networks 26(3): 165-173 (2019)
• 
  Shivangi Surati, Devesh C. Jinwala, Sanjay Garg:
  BMMI-tree: A Peer-to-Peer m-ary tree using 1-m node splitting for an efficient multidimensional complex query search. J. Parallel Distributed Comput. 125: 1-17 (2019)
• 
  Xiaohuan Shan, Jingjiao Ma, Jianye Gao, Zixuan Xu, Baoyan Song:
  A Subgraph Query Method Based on Adjacent Node Features on Large-Scale Label Graphs. WISA 2019: 226-238
• 2018
• 
  Nitendra Tomar, Rakesh Matam:
  Optimal Query-Processing-Node Discovery in IoT-Fog Computing Environment. ICACCI 2018: 237-241
• 2017
• 
  Audun Stolpe, Jonas Halvorsen:
  Distributed query processing in the presence of blank nodes. Semantic Web 8(6): 1001-1021 (2017)
• 
  Daniel Hernández, Claudio Gutiérrez:
  Semantics for Querying Paths in Graph Databases: No-repeated-node or No-repeated-edge? AMW 2017
• 
  Sebastian Mate, Patric Vormstein, Dennis Kadioglu, Raphael W. Majeed, Martin Lablans, Hans-Ulrich Prokosch, Holger Storf:
  On-The-Fly Query Translation Between i2b2 and Samply in the German Biobank Node (GBN) Prototypes. GMDS 2017: 42-46
• 2016
• 
  Takuji Tsuda, Yuka Komai, Takahiro Hara, Shojiro Nishio:
  Top-k Query Processing and Malicious Node Identification Based on Node Grouping in MANETs. IEEE Access 4: 993-1007 (2016)
• 
  Amine Roukh, Ladjel Bellatreche, Nikos Tziritas, Carlos Ordonez:
  Energy-Aware Query Processing on a Parallel Database Cluster Node. ICA3PP 2016: 260-269
• 
  Francesco Gargiulo, Flora Amato, Vincenzo Moscato, Antonio Picariello, Giancarlo Sperlì:
  Nearest Query on Distributed Binary Trees Starting from a Random Node. KESW 2016: 257-271
• 
  Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder:
  Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. MFCS 2016: 17:1-17:14
• 2015
• 
  Kazuki Miyahara, Kenji Hashimoto, Hiroyuki Seki:
  Node Query Preservation for Deterministic Linear Top-Down Tree Transducers. IEICE Trans. Inf. Syst. 98-D(3): 512-523 (2015)
• 
  Zidong Zhang, Lihua Zhou, Lizhen Wang, Hongmei Chen, Peizhong Yang:
  SQNR: A System for Querying Nodes and relations in multi-relational social networks. FSKD 2015: 1503-1507
• 
  Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder:
  Graph properties in node-query setting: effect of breaking symmetry. CoRR abs/1510.08267 (2015)
• 
  Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi:
  Node Selection Query Languages for Trees. CoRR abs/1509.08979 (2015)
• 
  Colin White:
  Lower Bounds on the Query Times of Hub Labeling, Contraction Hierarchies, and Transit Node Routing. CoRR abs/1501.04262 (2015)
• 2014
• 
  Takuji Tsuda, Yuka Komai, Yuya Sasaki, Takahiro Hara, Shojiro Nishio:
  Top-k Query Processing and Malicious Node Identification against Data Replacement Attack in MANETs. MDM (1) 2014: 279-288
• 2013
• 
  Alan B. Stokes, Alvaro A. A. Fernandes, Norman W. Paton:
  Adapting to Node Failure in Sensor Network Query Processing. BNCOD 2013: 33-47
• 
  Daniel Schall, Theo Härder:
  Energy-proportional query execution using a cluster of wimpy nodes. DaMoN 2013: 1
• 
  Xavier Cortés, Francesc Serratosa:
  Active-Learning Query Strategies Applied to Select a Graph Node Given a Graph Labelling. GbRPR 2013: 61-70
• 
  Kazuki Miyahara, Kenji Hashimoto, Hiroyuki Seki:
  Node Query Preservation for Deterministic Linear Top-Down Tree Transducers. TTATT 2013: 27-37
• 2012
• 
  Yangjun Chen, Yibin Chen:
  Subtree Reconstruction, Query Node Intervals and Tree Pattern Query Evaluation. J. Inf. Sci. Eng. 28(2): 263-293 (2012)
• 2011
• 
  Evangelos Outsios, Georgios Evangelidis:
  Data Node Splitting Policies for Improved Range Query Efficiency in k-dimensional Point Data Indexes. Panhellenic Conference on Informatics 2011: 46-50

skipping 16 more matches