├── Bridge_Example_Graph.ifc ├── Ifc2Neo4j.py ├── LICENSE ├── README.md └── sensordata.csv /Ifc2Neo4j.py: -------------------------------------------------------------------------------- 1 | import re #Import regex 2 | 3 | ############ Convert IFC express schema to Python lists ############ 4 | 5 | schema = open("IFC4.express schema.txt","r") 6 | 7 | #Bring schema into python as list 8 | entities = [] 9 | entities_1=[] 10 | #Read lines and append everything between entity and end_entity 11 | for line in schema: 12 | 13 | #If the line start with entity, clear list of entities_1, so it start saving from the start of the entity to the end 14 | if line[:6] == "ENTITY": 15 | entities_1=[] 16 | 17 | #Always append lines to the entities_1 list 18 | entities_1.append(line.replace("\n","").replace("\t","")) 19 | 20 | #When the line comes to "end_entity" then append the list to actual entities list 21 | if line[:10] == "END_ENTITY": 22 | entities.append(entities_1) 23 | 24 | #for i in entities: 25 | #for j in i: 26 | #print(j) 27 | 28 | 29 | ############ Parsing IFC express schema of separate express entities ############ 30 | 31 | parsed_entities=[] 32 | 33 | for ent in entities: 34 | ent_parsed = [] 35 | 36 | ### If last character (";") of first element ("ENTITY Ifcperson;"), then approach differenty, 37 | ### since those are not in the hiearchy, don't have sub or super type 38 | if ent[0][-1] ==";": 39 | #[7:] removes ENTITY at the start, [:-1] removes \n at the end and replace removes ";" 40 | ent_parsed.append(ent[0][7:][:-1].replace(";","")) 41 | ent_parsed.append("No") #These ifc types are not abstract 42 | ent_parsed.append(None) #These ifc types are not subtypes or supertypes 43 | 44 | # Pattern here is that attributes will have tab "\t" in front of string, which was removed in previous step 45 | # and where it says " DERIVE" or " WHERE" will have a space " " in front, so when we first encounter " " 46 | # at the front then we break the loop. 47 | # ent[1:-2] takes the list without the first and the last two elements from the list 48 | for att in ent[1:-2]: 49 | att_split=[] 50 | # break when we encounter that the first character of the string is space " " 51 | if att[0] == " ": 52 | break 53 | att_split=att.replace(";","").split(" : ") 54 | findifc=re.search('Ifc(.*)',att_split[1]) 55 | att_split[1]=findifc[0] if findifc != None else att_split[1] 56 | ent_parsed.append(att_split) 57 | 58 | ### Else parse all other entities, which have subtypes and do not have ";" at the end 59 | else: 60 | # First item in list is entity name 61 | ent_parsed.append(ent[0][7:]) 62 | 63 | # Second item check if it is abstarct and append either "yes" or "no" 64 | if ent[1][1:5] == "ABST": 65 | ent_parsed.append("yes") 66 | else: 67 | ent_parsed.append("No") 68 | 69 | #Append None for the third element, if there is subtype, then override it 70 | ent_parsed.append(None) 71 | 72 | # Iterate over all lines in entity without first and last two 73 | for att in ent[1:-2]: 74 | 75 | # If line start with "SUB" as in SUBTYPE of (ifc...) then find and replace None with the name inside parenthesis 76 | if att[1:4] == "SUB": 77 | ent_parsed[2] = re.findall('\(([^)]+)\)',att)[0] 78 | 79 | # Find all items that have " : " in the middle and ";" at the end, which signifies an attribute 80 | # Append said attribute after it is split and cleaned 81 | if re.search(r'(.*) \: (.*);', att): 82 | att_split=[] 83 | att_split=att.replace(";","").split(" : ") 84 | findifc=re.search('Ifc(.*)',att_split[1]) 85 | att_split[1]=findifc[0] if findifc != None else att_split[1] 86 | ent_parsed.append(att_split) 87 | 88 | # If we encounter words INVERSE or WHERE or DERIVE or UNIQUE then break the loop, since attributed are before them 89 | if att[1:8] == "INVERSE" or att[1:7] == "WHERE" or att[1:8] == "DERIVE" or att[1:8] == "UNIQUE": 90 | break 91 | 92 | #Append parsed list of entities to a grouped list of all entities 93 | parsed_entities.append(ent_parsed) 94 | 95 | 96 | ############ Adding attributes to subtypes from the supertypes ############ 97 | 98 | ent_names=[i[0] for i in parsed_entities] 99 | entities_with_attributes=[] 100 | ent_att=[] 101 | 102 | #Loop over all entities and insert the attributes from the hiearchy and save in new list, which will be used for dictionary 103 | for entity in parsed_entities: 104 | 105 | # Start with the current entity as the iterated entity 106 | ent_att=list(entity) 107 | current_entity=entity 108 | 109 | # Loop until the current entity has 'None' under subtypes 110 | while current_entity[2] != None: 111 | 112 | # Get the index of supertype of current entity 113 | # Replace current entity with the supertype of it by using getting it from the list with the index 114 | en = ent_names.index(current_entity[2]) 115 | current_entity = parsed_entities[en] 116 | 117 | # Check if it has attributes, if it has not if will be empty list 118 | if current_entity[3:] != []: 119 | #Insert attributes of all supertype entites to the first entity 120 | for at in reversed(current_entity[3:]): 121 | ent_att.insert(3,at) 122 | 123 | entities_with_attributes.append(ent_att) 124 | 125 | 126 | #print(entities_with_attributes) 127 | 128 | 129 | ############ Creating a dictionary of IFC express entities ############ 130 | 131 | IfcEntity_dict={} # Master dictionary -> IfcEntity_dict[IfcWall] ifc entries 132 | dictstr=[] 133 | 134 | # Run commands to create dictionaries and save them to a list or a file 135 | for e in entities_with_attributes: 136 | 137 | # Ignore abstract entities and entities without attributes for dictonary 138 | if e[1] == 'No' and e[3:] != []: 139 | 140 | # Create strings with commands for dictionaries and the names are ALL UPPER CASE so it matches ifc files 141 | dictstr = "IfcEntity_dict['" + str(e[0].upper()+"'] = {" ) 142 | for attr in e[3:]: 143 | dictstr = dictstr + "'" + attr[0] + "' : '" + attr[1] +"', " 144 | dictstr = str(dictstr[:-2] + "}") 145 | 146 | # Run commands for dictionary 147 | exec(dictstr) 148 | 149 | 150 | 151 | 152 | ############ Functions for parsing IFC file ############ 153 | 154 | def LINE_reader(file): 155 | #Reads only IFC lines, which have "#" infront. 156 | 157 | for line in file: 158 | if line[0][0] == '#': 159 | yield line 160 | 161 | def SPLIT_line(line): 162 | 163 | #import re #import regex if using seperate python files 164 | 165 | 166 | IFC_split = line.replace("= ","&,&").replace("(","&,&",1).split("&,&") 167 | IFC_split[0] = IFC_split[0] 168 | IFC_split[2] = IFC_split[2][:-3] 169 | 170 | #Splits attributes for commas "," everywhere, except inside parentheses "()" > ['$','$','(#1,#2)'] 171 | Attributes = re.split(r"\,(?![^()]*\))(?![^'(\.)']*\',)",IFC_split[2]) 172 | 173 | # \,(?![^'(\.)']*\',) match "," except in single quotes '' #There might be special cases where this does not work 174 | # \,(?![^()]*\)) match "," except in parenthesis () 175 | 176 | for n in range(len(Attributes)): 177 | 178 | 179 | #Looks for nested IFC objects > #5175= IFCPROPERTYSINGLEVALUE('Reference',$,IFCIDENTIFIER('8mm Head'),$); 180 | if str(Attributes[n]).find("IFC") == 0: 181 | Attributes[n]=Attributes[n].replace(")","").split("(") 182 | 183 | else: 184 | #Looks for nested attributes > ($,$,(#1,#2)) and makes a nested list > [$,$,[#1,#2]] 185 | #Find if an list element contains parentheses "()" so that its content gets split into a nested list 186 | NestedAtt=re.findall("\(([^)]*)\)(?![^'(\.)']*\')", Attributes[n]) 187 | 188 | #Splits only elements inside "()" 189 | if NestedAtt != []: 190 | Attributes[n] = NestedAtt[0].split(",") 191 | 192 | IFC_split[2] = Attributes 193 | return IFC_split 194 | 195 | def STEP_parser(path_file): 196 | 197 | 198 | f=open(path_file,"r") 199 | 200 | for line in LINE_reader(f): 201 | 202 | yield SPLIT_line(line) 203 | 204 | 205 | ############ Exporting for Noe4j Admin Import ############ 206 | 207 | ### IFC FILE PATH 208 | ifc_path = "example.ifc" 209 | ### IFC FILE PATH 210 | 211 | Node_root = open("Ifc_Node_root.csv","w") 212 | Node_att = open("Ifc_Node_att.csv","w") 213 | Node_nonroot = open("Ifc_Node_nonroot.csv","w") 214 | Connection = open("Ifc_Connection_all.csv","w") 215 | 216 | 217 | #Headers for the csv files, 1) file for rooted entities, 2) for attributes, 3) for non_rooted entities and 4) for connections 218 | header_root = "IfcId:ID|:LABEL|GlobalId|Name|Description\n" 219 | header_att = "IfcId:ID|:LABEL|Value\n" 220 | header_non_root = "IfcId:ID|:LABEL\n" 221 | header_conn = ":START_ID|:END_ID|:TYPE|order:int\n" 222 | 223 | Node_root.write(header_root) 224 | Node_att.write(header_att) 225 | Node_nonroot.write(header_non_root) 226 | Connection.write(header_conn) 227 | 228 | 229 | for ifc in STEP_parser(ifc_path): 230 | 231 | # List of dictionary keys and values for specific entity in a loop 232 | keys = list(IfcEntity_dict[ifc[1]].keys()) 233 | values = list(IfcEntity_dict[ifc[1]].values()) 234 | 235 | # Check if they have GlobalId, then they are rooted classes 236 | if "GlobalId" in IfcEntity_dict[ifc[1]]: 237 | 238 | # For nodes that are derived from IfcRoot (they contain GlobalId), take their name and first 4 attributes, which are 239 | # GlobalId, OwnerHistory, Name, Description 240 | 241 | # Write node based on an entity and a connection to Owner History 242 | neo_root = str(ifc[0]+"|"+ifc[1]+"|"+ifc[2][0]+"|"+ifc[2][2]+"|"+ifc[2][3]+"\n").replace("*","").replace("$","") 243 | neo_conn = ifc[0]+"|"+ifc[2][1]+"|"+keys[1]+"|"+"1"+"\n" #Owner History 244 | Node_root.write(neo_root.replace("'","")) 245 | Connection.write(neo_conn) 246 | 247 | # Loop over attributes with item and number from 5th attribute forward "[4:]" 248 | for n,att in enumerate(ifc[2][4:]): 249 | 250 | # If an single attribute is a sublist then loop over that sublist 251 | if isinstance(att,list): 252 | 253 | # Currently it is a simple solution to just save a sublist as an single value string 254 | neo_att = ifc[0]+"_"+str(n+4)+"|"+values[n+4]+"|"+str(att)+"\n" 255 | neo_conn = ifc[0]+"|"+ifc[0]+"_"+str(n+4)+"|"+keys[n+4].upper()+"|"+str(n+4)+"\n" 256 | Node_att.write(neo_att.replace("'","")) 257 | Connection.write(neo_conn) 258 | 259 | # If the sublist has connection then loop over them and connect it to the subnode 260 | for n2,att2 in enumerate(att): 261 | if att2[0] == "#": 262 | neo_conn = ifc[0]+"_"+str(n+4)+"|"+att2+"|"+keys[n+4].upper()+"|"+str(n2)+"\n" 263 | #print(neo_conn) 264 | Connection.write(neo_conn) 265 | 266 | 267 | # If an attribute is not a list then just create a node and connection to that node 268 | else: 269 | 270 | # If it contains a connection label with "#" than create a connection 271 | if att[0] == "#": 272 | neo_conn = ifc[0]+"|"+att+"|" + keys[n+4].upper()+"|"+ str(n+4)+"\n" 273 | Connection.write(neo_conn) 274 | 275 | # Else create a node and a connection to that node 276 | else: 277 | neo_att = str(ifc[0]+"_"+str(n+4)+"|"+values[n+4]+"|"+str(att)+"\n") #.replace("*","").replace("$","") 278 | neo_conn = ifc[0] +"|"+ifc[0]+"_"+str(n+4)+"|"+keys[n+4].upper()+"|"+str(n+4)+"\n" 279 | Node_att.write(neo_att.replace("'","")) 280 | Connection.write(neo_conn) 281 | 282 | 283 | # If it does not have GlobalId, do everything the same, except dont start with attributes from the 5th onward 284 | else: 285 | 286 | neo_non_root = ifc[0]+"|"+ifc[1]+"\n" 287 | #print(neo_non_root) 288 | Node_nonroot.write(neo_non_root.replace("'","")) 289 | 290 | for n,att in enumerate(ifc[2]): 291 | 292 | if isinstance(att,list): 293 | print(ifc[0],values[n],n) 294 | neo_att = ifc[0]+"_"+str(n)+"|"+values[n]+"|"+str(att)+"\n" 295 | neo_conn = ifc[0]+"|"+ifc[0]+"_"+str(n)+"|"+keys[n].upper()+"|"+str(n)+"\n" 296 | Node_att.write(neo_att.replace("'","")) 297 | Connection.write(neo_conn) 298 | 299 | for n2,att2 in enumerate(att): 300 | if att2 != "" and att2[0] == "#": 301 | neo_conn = ifc[0]+"_"+str(n)+"|"+att2+"|"+keys[n].upper()+"|"+str(n2)+"\n" 302 | Connection.write(neo_conn) 303 | 304 | else: 305 | if att[0] == "#": 306 | neo_conn = ifc[0]+"|"+att+"|" + keys[n].upper()+"|"+ str(n)+"\n" 307 | Connection.write(neo_conn) 308 | 309 | else: 310 | neo_att = str(ifc[0]+"_"+str(n)+"|"+values[n]+"|"+str(att)+"\n") #.replace("*","").replace("$","") 311 | neo_conn = ifc[0] +"|"+ifc[0]+"_"+str(n)+"|"+keys[n].upper()+"|"+str(n)+"\n" 312 | Node_att.write(neo_att.replace("'","")) 313 | Connection.write(neo_conn) 314 | 315 | print("done") 316 | 317 | 318 | 319 | 320 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 2, June 1991 3 | 4 | Copyright (C) 1989, 1991 Free Software Foundation, Inc., 5 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 6 | Everyone is permitted to copy and distribute verbatim copies 7 | of this license document, but changing it is not allowed. 8 | 9 | Preamble 10 | 11 | The licenses for most software are designed to take away your 12 | freedom to share and change it. By contrast, the GNU General Public 13 | License is intended to guarantee your freedom to share and change free 14 | software--to make sure the software is free for all its users. This 15 | General Public License applies to most of the Free Software 16 | Foundation's software and to any other program whose authors commit to 17 | using it. (Some other Free Software Foundation software is covered by 18 | the GNU Lesser General Public License instead.) You can apply it to 19 | your programs, too. 20 | 21 | When we speak of free software, we are referring to freedom, not 22 | price. Our General Public Licenses are designed to make sure that you 23 | have the freedom to distribute copies of free software (and charge for 24 | this service if you wish), that you receive source code or can get it 25 | if you want it, that you can change the software or use pieces of it 26 | in new free programs; and that you know you can do these things. 27 | 28 | To protect your rights, we need to make restrictions that forbid 29 | anyone to deny you these rights or to ask you to surrender the rights. 30 | These restrictions translate to certain responsibilities for you if you 31 | distribute copies of the software, or if you modify it. 32 | 33 | For example, if you distribute copies of such a program, whether 34 | gratis or for a fee, you must give the recipients all the rights that 35 | you have. You must make sure that they, too, receive or can get the 36 | source code. And you must show them these terms so they know their 37 | rights. 38 | 39 | We protect your rights with two steps: (1) copyright the software, and 40 | (2) offer you this license which gives you legal permission to copy, 41 | distribute and/or modify the software. 42 | 43 | Also, for each author's protection and ours, we want to make certain 44 | that everyone understands that there is no warranty for this free 45 | software. If the software is modified by someone else and passed on, we 46 | want its recipients to know that what they have is not the original, so 47 | that any problems introduced by others will not reflect on the original 48 | authors' reputations. 49 | 50 | Finally, any free program is threatened constantly by software 51 | patents. We wish to avoid the danger that redistributors of a free 52 | program will individually obtain patent licenses, in effect making the 53 | program proprietary. To prevent this, we have made it clear that any 54 | patent must be licensed for everyone's free use or not licensed at all. 55 | 56 | The precise terms and conditions for copying, distribution and 57 | modification follow. 58 | 59 | GNU GENERAL PUBLIC LICENSE 60 | TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 61 | 62 | 0. This License applies to any program or other work which contains 63 | a notice placed by the copyright holder saying it may be distributed 64 | under the terms of this General Public License. The "Program", below, 65 | refers to any such program or work, and a "work based on the Program" 66 | means either the Program or any derivative work under copyright law: 67 | that is to say, a work containing the Program or a portion of it, 68 | either verbatim or with modifications and/or translated into another 69 | language. (Hereinafter, translation is included without limitation in 70 | the term "modification".) Each licensee is addressed as "you". 71 | 72 | Activities other than copying, distribution and modification are not 73 | covered by this License; they are outside its scope. The act of 74 | running the Program is not restricted, and the output from the Program 75 | is covered only if its contents constitute a work based on the 76 | Program (independent of having been made by running the Program). 77 | Whether that is true depends on what the Program does. 78 | 79 | 1. You may copy and distribute verbatim copies of the Program's 80 | source code as you receive it, in any medium, provided that you 81 | conspicuously and appropriately publish on each copy an appropriate 82 | copyright notice and disclaimer of warranty; keep intact all the 83 | notices that refer to this License and to the absence of any warranty; 84 | and give any other recipients of the Program a copy of this License 85 | along with the Program. 86 | 87 | You may charge a fee for the physical act of transferring a copy, and 88 | you may at your option offer warranty protection in exchange for a fee. 89 | 90 | 2. You may modify your copy or copies of the Program or any portion 91 | of it, thus forming a work based on the Program, and copy and 92 | distribute such modifications or work under the terms of Section 1 93 | above, provided that you also meet all of these conditions: 94 | 95 | a) You must cause the modified files to carry prominent notices 96 | stating that you changed the files and the date of any change. 97 | 98 | b) You must cause any work that you distribute or publish, that in 99 | whole or in part contains or is derived from the Program or any 100 | part thereof, to be licensed as a whole at no charge to all third 101 | parties under the terms of this License. 102 | 103 | c) If the modified program normally reads commands interactively 104 | when run, you must cause it, when started running for such 105 | interactive use in the most ordinary way, to print or display an 106 | announcement including an appropriate copyright notice and a 107 | notice that there is no warranty (or else, saying that you provide 108 | a warranty) and that users may redistribute the program under 109 | these conditions, and telling the user how to view a copy of this 110 | License. (Exception: if the Program itself is interactive but 111 | does not normally print such an announcement, your work based on 112 | the Program is not required to print an announcement.) 113 | 114 | These requirements apply to the modified work as a whole. If 115 | identifiable sections of that work are not derived from the Program, 116 | and can be reasonably considered independent and separate works in 117 | themselves, then this License, and its terms, do not apply to those 118 | sections when you distribute them as separate works. But when you 119 | distribute the same sections as part of a whole which is a work based 120 | on the Program, the distribution of the whole must be on the terms of 121 | this License, whose permissions for other licensees extend to the 122 | entire whole, and thus to each and every part regardless of who wrote it. 123 | 124 | Thus, it is not the intent of this section to claim rights or contest 125 | your rights to work written entirely by you; rather, the intent is to 126 | exercise the right to control the distribution of derivative or 127 | collective works based on the Program. 128 | 129 | In addition, mere aggregation of another work not based on the Program 130 | with the Program (or with a work based on the Program) on a volume of 131 | a storage or distribution medium does not bring the other work under 132 | the scope of this License. 133 | 134 | 3. You may copy and distribute the Program (or a work based on it, 135 | under Section 2) in object code or executable form under the terms of 136 | Sections 1 and 2 above provided that you also do one of the following: 137 | 138 | a) Accompany it with the complete corresponding machine-readable 139 | source code, which must be distributed under the terms of Sections 140 | 1 and 2 above on a medium customarily used for software interchange; or, 141 | 142 | b) Accompany it with a written offer, valid for at least three 143 | years, to give any third party, for a charge no more than your 144 | cost of physically performing source distribution, a complete 145 | machine-readable copy of the corresponding source code, to be 146 | distributed under the terms of Sections 1 and 2 above on a medium 147 | customarily used for software interchange; or, 148 | 149 | c) Accompany it with the information you received as to the offer 150 | to distribute corresponding source code. (This alternative is 151 | allowed only for noncommercial distribution and only if you 152 | received the program in object code or executable form with such 153 | an offer, in accord with Subsection b above.) 154 | 155 | The source code for a work means the preferred form of the work for 156 | making modifications to it. For an executable work, complete source 157 | code means all the source code for all modules it contains, plus any 158 | associated interface definition files, plus the scripts used to 159 | control compilation and installation of the executable. However, as a 160 | special exception, the source code distributed need not include 161 | anything that is normally distributed (in either source or binary 162 | form) with the major components (compiler, kernel, and so on) of the 163 | operating system on which the executable runs, unless that component 164 | itself accompanies the executable. 165 | 166 | If distribution of executable or object code is made by offering 167 | access to copy from a designated place, then offering equivalent 168 | access to copy the source code from the same place counts as 169 | distribution of the source code, even though third parties are not 170 | compelled to copy the source along with the object code. 171 | 172 | 4. You may not copy, modify, sublicense, or distribute the Program 173 | except as expressly provided under this License. Any attempt 174 | otherwise to copy, modify, sublicense or distribute the Program is 175 | void, and will automatically terminate your rights under this License. 176 | However, parties who have received copies, or rights, from you under 177 | this License will not have their licenses terminated so long as such 178 | parties remain in full compliance. 179 | 180 | 5. You are not required to accept this License, since you have not 181 | signed it. However, nothing else grants you permission to modify or 182 | distribute the Program or its derivative works. These actions are 183 | prohibited by law if you do not accept this License. Therefore, by 184 | modifying or distributing the Program (or any work based on the 185 | Program), you indicate your acceptance of this License to do so, and 186 | all its terms and conditions for copying, distributing or modifying 187 | the Program or works based on it. 188 | 189 | 6. Each time you redistribute the Program (or any work based on the 190 | Program), the recipient automatically receives a license from the 191 | original licensor to copy, distribute or modify the Program subject to 192 | these terms and conditions. You may not impose any further 193 | restrictions on the recipients' exercise of the rights granted herein. 194 | You are not responsible for enforcing compliance by third parties to 195 | this License. 196 | 197 | 7. If, as a consequence of a court judgment or allegation of patent 198 | infringement or for any other reason (not limited to patent issues), 199 | conditions are imposed on you (whether by court order, agreement or 200 | otherwise) that contradict the conditions of this License, they do not 201 | excuse you from the conditions of this License. If you cannot 202 | distribute so as to satisfy simultaneously your obligations under this 203 | License and any other pertinent obligations, then as a consequence you 204 | may not distribute the Program at all. For example, if a patent 205 | license would not permit royalty-free redistribution of the Program by 206 | all those who receive copies directly or indirectly through you, then 207 | the only way you could satisfy both it and this License would be to 208 | refrain entirely from distribution of the Program. 209 | 210 | If any portion of this section is held invalid or unenforceable under 211 | any particular circumstance, the balance of the section is intended to 212 | apply and the section as a whole is intended to apply in other 213 | circumstances. 214 | 215 | It is not the purpose of this section to induce you to infringe any 216 | patents or other property right claims or to contest validity of any 217 | such claims; this section has the sole purpose of protecting the 218 | integrity of the free software distribution system, which is 219 | implemented by public license practices. Many people have made 220 | generous contributions to the wide range of software distributed 221 | through that system in reliance on consistent application of that 222 | system; it is up to the author/donor to decide if he or she is willing 223 | to distribute software through any other system and a licensee cannot 224 | impose that choice. 225 | 226 | This section is intended to make thoroughly clear what is believed to 227 | be a consequence of the rest of this License. 228 | 229 | 8. If the distribution and/or use of the Program is restricted in 230 | certain countries either by patents or by copyrighted interfaces, the 231 | original copyright holder who places the Program under this License 232 | may add an explicit geographical distribution limitation excluding 233 | those countries, so that distribution is permitted only in or among 234 | countries not thus excluded. In such case, this License incorporates 235 | the limitation as if written in the body of this License. 236 | 237 | 9. The Free Software Foundation may publish revised and/or new versions 238 | of the General Public License from time to time. Such new versions will 239 | be similar in spirit to the present version, but may differ in detail to 240 | address new problems or concerns. 241 | 242 | Each version is given a distinguishing version number. If the Program 243 | specifies a version number of this License which applies to it and "any 244 | later version", you have the option of following the terms and conditions 245 | either of that version or of any later version published by the Free 246 | Software Foundation. If the Program does not specify a version number of 247 | this License, you may choose any version ever published by the Free Software 248 | Foundation. 249 | 250 | 10. If you wish to incorporate parts of the Program into other free 251 | programs whose distribution conditions are different, write to the author 252 | to ask for permission. For software which is copyrighted by the Free 253 | Software Foundation, write to the Free Software Foundation; we sometimes 254 | make exceptions for this. Our decision will be guided by the two goals 255 | of preserving the free status of all derivatives of our free software and 256 | of promoting the sharing and reuse of software generally. 257 | 258 | NO WARRANTY 259 | 260 | 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY 261 | FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN 262 | OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES 263 | PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED 264 | OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 265 | MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS 266 | TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE 267 | PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, 268 | REPAIR OR CORRECTION. 269 | 270 | 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 271 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR 272 | REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, 273 | INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING 274 | OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED 275 | TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY 276 | YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER 277 | PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE 278 | POSSIBILITY OF SUCH DAMAGES. 279 | 280 | END OF TERMS AND CONDITIONS 281 | 282 | How to Apply These Terms to Your New Programs 283 | 284 | If you develop a new program, and you want it to be of the greatest 285 | possible use to the public, the best way to achieve this is to make it 286 | free software which everyone can redistribute and change under these terms. 287 | 288 | To do so, attach the following notices to the program. It is safest 289 | to attach them to the start of each source file to most effectively 290 | convey the exclusion of warranty; and each file should have at least 291 | the "copyright" line and a pointer to where the full notice is found. 292 | 293 | 294 | Copyright (C) 295 | 296 | This program is free software; you can redistribute it and/or modify 297 | it under the terms of the GNU General Public License as published by 298 | the Free Software Foundation; either version 2 of the License, or 299 | (at your option) any later version. 300 | 301 | This program is distributed in the hope that it will be useful, 302 | but WITHOUT ANY WARRANTY; without even the implied warranty of 303 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 304 | GNU General Public License for more details. 305 | 306 | You should have received a copy of the GNU General Public License along 307 | with this program; if not, write to the Free Software Foundation, Inc., 308 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 309 | 310 | Also add information on how to contact you by electronic and paper mail. 311 | 312 | If the program is interactive, make it output a short notice like this 313 | when it starts in an interactive mode: 314 | 315 | Gnomovision version 69, Copyright (C) year name of author 316 | Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 317 | This is free software, and you are welcome to redistribute it 318 | under certain conditions; type `show c' for details. 319 | 320 | The hypothetical commands `show w' and `show c' should show the appropriate 321 | parts of the General Public License. Of course, the commands you use may 322 | be called something other than `show w' and `show c'; they could even be 323 | mouse-clicks or menu items--whatever suits your program. 324 | 325 | You should also get your employer (if you work as a programmer) or your 326 | school, if any, to sign a "copyright disclaimer" for the program, if 327 | necessary. Here is a sample; alter the names: 328 | 329 | Yoyodyne, Inc., hereby disclaims all copyright interest in the program 330 | `Gnomovision' (which makes passes at compilers) written by James Hacker. 331 | 332 | , 1 April 1989 333 | Ty Coon, President of Vice 334 | 335 | This General Public License does not permit incorporating your program into 336 | proprietary programs. If your program is a subroutine library, you may 337 | consider it more useful to permit linking proprietary applications with the 338 | library. If this is what you want to do, use the GNU Lesser General 339 | Public License instead of this License. 340 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | Link to paper: https://www.hindawi.com/journals/ace/2021/4913394/ 2 | 3 | 4 | 5 | # IFC and Sensor Database Example 6 | Bridge_Example_Graph.ifc represent IFC model of a bridge monitoring example 7 | sensordata.csv contains sensor data used in the example 8 | 9 | 10 | 11 | Ifc2Neo4j contains script used to create .csv files which are to be imported to Neo4j using Neo4j Admin Import with the following command: 12 | > bin\neo4j-admin import --database=neo4j --nodes=import\Ifc_Node_root.csv --nodes=import\Ifc_Node_att.csv --nodes=import\Ifc_Node_nonroot.csv --relationships=import\Ifc_Connection_all.csv --delimiter="|" 13 | --------------------------------------------------------------------------------